Planar graphs without cycles of length 3, 4, and 6 are (3, 3)-colorable

DOI10.1155/2024/7884281MaRDI QIDQ6657759

Pongpat Sittitrai, Wannapol Pimpasalee

Publication date: 6 January 2025

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Cites Work

• Planar graphs with girth at least 5 are \((3, 5)\)-colorable
• Near-colorings: non-colorable graphs and NP-completeness
• On the vertex partition of planar graphs into forests with bounded degree
• Vertex partitions of \((C_3, C_4, C_6)\)-free planar graphs
• Defective 2-colorings of sparse graphs
• Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
• Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs
• A sufficient condition for planar graphs with girth 5 to be \((1,6)\)-colorable

This page was built for publication: Planar graphs without cycles of length 3, 4, and 6 are (3, 3)-colorable