A comment to: On 3-colorable planar graphs without short cycles
classification
🧮 math.CO
keywords
cycleswithoutcolorablegraphplanarcommentcorrectedge
read the original abstract
Let G be a graph. It was proved that if G is a planar graph without {4, 6, 7}-cycles and without two 5-cycles sharing exactly one edge, then G 3-colorable. We observed that the proof of this result is not correct.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.