A 3-color theorem on plane graphs without 5-circuits
From MaRDI portal
Publication:2644333
DOI10.1007/s10114-005-0851-7zbMath1122.05038MaRDI QIDQ2644333
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
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, Distance constraints on short cycles for 3-colorability of planar graphs, Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable, Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable, On 3-colorable plane graphs without 5- and 7-cycles, Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable, \(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, Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable, A relaxation of the Bordeaux conjecture, Facially-constrained colorings of plane graphs: a survey, 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
