Planar graphs without 4-, 5- and 8-cycles are 3-colorable

DOI10.7151/DMGT.1579MaRDI QIDQ2906360zbMATH OpenOpenAlexFDO

Authors Sakib A. Mondal

Publication date 5 September 2012

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1579

zbMATH Keywords

3-coloringplanar graphdischarging

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cited in

(6)

• Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
• On the 3-colorability of planar graphs without \(\{4,8,9\}\)-cycles
• Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
• Plane graphs without 4- and 5-cycles and without ext-triangular 7-cycles are 3-colorable
• Every signed planar graph without cycles of length from 4 to 8 is 3-colorable
• \((1,0,0)\)-colorability of planar graphs without prescribed short cycles

This page was built for publication: Planar graphs without 4-, 5- and 8-cycles are 3-colorable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906360)