A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits

DOI10.1007/s10255-014-0418-4zbMath1304.05055OpenAlexW2130284808MaRDI QIDQ477505

Bao-Gang Xu

Publication date: 9 December 2014

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-014-0418-4

zbMATH Keywords

circuitcoloringplane graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• On 3-colorings of plane graphs
• On 3-colorable plane graphs without 5- and 7-cycles
• Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
• A sufficient condition for planar graphs to be 3-colorable
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• A note on the three color problem
• A 3-color theorem on plane graphs without 5-circuits
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• Unnamed Item
• Unnamed Item

This page was built for publication: A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits