Planar graphs without 5- and 8-cycles and adjacent triangles are 3-colorable

zbMATH Open1252.05069MaRDI QIDQ2906261FDOQ2906261

Authors: Sakib A. Mondal 

Publication date: 5 September 2012

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

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 (2)

• Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
• Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable

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

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