A sufficient condition for planar graphs to be 3-colorable
From MaRDI portal
Publication:1405097
DOI10.1016/S0095-8956(03)00025-XzbMath1023.05046OpenAlexW2104261748MaRDI QIDQ1405097
Andre Raspaud, Oleg V. Borodin
Publication date: 25 August 2003
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0095-8956(03)00025-x
Related Items (30)
Building a maximal independent set for the vertex-coloring problem on planar graphs ⋮ A 3-color theorem on plane graphs without 5-circuits ⋮ On 3-colorable plane graphs without 5- and 7-cycles ⋮ Steinberg's conjecture is false ⋮ A non-3-choosable planar graph without cycles of length 4 and 5 ⋮ Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable ⋮ A step towards the strong version of Havel's three color conjecture ⋮ Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable ⋮ Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable ⋮ Fast 3-coloring triangle-free planar graphs ⋮ Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph ⋮ A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits ⋮ Distance constraints on short cycles for 3-colorability of planar graphs ⋮ Bordeaux 3-color conjecture and 3-choosability ⋮ Unnamed Item ⋮ On 3-colorings of plane 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 (2, 0, 0)-colorable ⋮ Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph ⋮ 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 ⋮ Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies ⋮ 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 ⋮ Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable ⋮ A relaxation of Novosibirsk 3-color conjecture ⋮ Every planar graph without adjacent cycles of length at most 8 is 3-choosable ⋮ Planar graphs without adjacent cycles of length at most seven are 3-colorable ⋮ A relaxation of the Bordeaux conjecture
Cites Work
This page was built for publication: A sufficient condition for planar graphs to be 3-colorable
