A 3-color theorem on plane graphs without 5-circuits

DOI10.1007/s10114-005-0851-7zbMath1122.05038MaRDI QIDQ2644333

Bao-Gang Xu

Publication date: 31 August 2007

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

Full work available at URL: https://doi.org/10.1007/s10114-005-0851-7

zbMATH Keywords

circuit; coloring; plane graph

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

Related Items

Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph, Acyclic total colorings of planar graphs without \(l\) cycles, A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits, Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable, On 3-colorable plane graphs without 5- and 7-cycles, \(f\)-colorings of some graphs of \(f\)-class 1, A structural theorem on embedded graphs and its application to colorings, Symmetry and transitive properties of monohedral \(f\)-triangulations of the Riemannian sphere, Planar graphs without adjacent cycles of length at most seven are 3-colorable, A step towards the strong version of Havel's three color conjecture, A relaxation of the Bordeaux conjecture, Unnamed Item, Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable, A NOTE ON 3-COLORABLE PLANE GRAPHS WITHOUT 5- AND 7-CYCLES

Cites Work

• On 3-colorings of plane graphs
• On 3-colorable plane graphs without 5- and 7-cycles
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item