A step towards the strong version of Havel's three color conjecture
From MaRDI portal
Publication:1931401
DOI10.1016/j.jctb.2012.08.001zbMath1256.05068OpenAlexW2068629692MaRDI QIDQ1931401
Oleg V. Borodin, Tommy R. Jensen, Alekseĭ Nikolaevich Glebov
Publication date: 14 January 2013
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2012.08.001
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (max. 100)
Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph ⋮ Distance constraints on short cycles for 3-colorability of planar graphs ⋮ Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies ⋮ Some of My Favorite Coloring Problems for Graphs and Digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
- Three-coloring planar graphs without short cycles
- On 3-colorable plane graphs without 5- and 7-cycles
- On 3-colorability of planar graphs without adjacent short cycles
- On 3-colorable planar graphs without short cycles
- Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
- Planar graphs without adjacent cycles of length at most seven are 3-colorable
- Some counterexamples associated with the three-color problem
- Some simplified NP-complete graph problems
- 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
- Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
- On 3-colorable planar graphs without cycles of four lengths
- On 3-colorable planar graphs without prescribed cycles
- Planar graphs without 4, 6, 8-cycles are 3-colorable
- Continuation of a 3-coloring from a 7-face onto a plane graph without \(C_3\)
- A 3-color theorem on plane graphs without 5-circuits
- Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable
- Coloring graphs with fixed genus and girth
- The color space of a graph
- 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: A step towards the strong version of Havel's three color conjecture
