A comment to: On 3-colorable planar graphs without short cycles
Abstract
Description
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.
2 pages
2 pages