Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
From MaRDI portal
Publication:1026007
DOI10.1016/j.jctb.2008.11.001zbMath1184.05024OpenAlexW2022190002MaRDI QIDQ1026007
Andre Raspaud, Mickaël Montassier, Oleg V. Borodin, Alekseĭ Nikolaevich Glebov
Publication date: 23 June 2009
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.2008.11.001
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (max. 100)
Further extensions of the Grötzsch theorem ⋮ Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. ⋮ Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles ⋮ Hyperbolic families and coloring graphs on surfaces ⋮ Steinberg's conjecture is false ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ A step towards the strong version of Havel's three color conjecture ⋮ Circular coloring and fractional coloring in planar graphs ⋮ Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable ⋮ Short proofs of coloring theorems on planar graphs ⋮ A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits ⋮ \((1,0,0)\)-colorability of planar graphs without prescribed short cycles ⋮ The 3-colorability of planar graphs without cycles of length 4, 6 and 9 ⋮ Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 ⋮ Unnamed Item ⋮ Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable ⋮ 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 ⋮ Note on 3-choosability of planar graphs with maximum degree 4 ⋮ Planar graphs without short even cycles are near-bipartite ⋮ On the 3-colorability of planar graphs without 4-, 7- and 9-cycles ⋮ A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles
Cites Work
- On 3-colorable plane graphs without 5- and 7-cycles
- 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
- Continuation of a 3-coloring from a 7-face onto a plane graph without \(C_3\)
- Coloring graphs with fixed genus and girth
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
