A 3-color theorem on plane graphs without 5-circuits
From MaRDI portal
Publication:2644333
DOI10.1007/s10114-005-0851-7zbMath1122.05038OpenAlexW2106859304MaRDI 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
Related Items (max. 100)
On 3-colorable plane graphs without 5- and 7-cycles ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ A step towards the strong version of Havel's three color conjecture ⋮ Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable ⋮ 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 ⋮ \(f\)-colorings of some graphs of \(f\)-class 1 ⋮ Unnamed Item ⋮ Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable ⋮ Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable ⋮ Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable ⋮ Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable ⋮ A NOTE ON 3-COLORABLE PLANE GRAPHS WITHOUT 5- AND 7-CYCLES ⋮ 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 relaxation of the Bordeaux conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
This page was built for publication: A 3-color theorem on plane graphs without 5-circuits
