On 3-colorings of plane graphs

DOI10.1007/S10255-004-0197-4zbMath1062.05063OpenAlexW2038803406MaRDI QIDQ705042

Bao-Gang Xu

Publication date: 25 January 2005

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

Full work available at URL: https://doi.org/10.1007/s10255-004-0197-4

zbMATH Keywords

trianglecyclecolouringplanar graph

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Colorings and orientations of graphs
• 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
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• On a conjecture of B. Grünbaum

This page was built for publication: On 3-colorings of plane graphs