On 3-colorable plane graphs without 5- and 7-cycles
From MaRDI portal
Publication:859619
DOI10.1016/j.jctb.2006.02.005zbMath1108.05046MaRDI QIDQ859619
Publication date: 16 January 2007
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.2006.02.005
Related Items
Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs, Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle., Steinberg's conjecture is false, 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, Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable, Three-coloring planar graphs without short cycles, Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable, On 3-colorable planar graphs without short cycles, Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable, A structural theorem on embedded graphs and its application to colorings, On the 3-colorability of planar graphs without 4-, 7- and 9-cycles, Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable, A step towards the strong version of Havel's three color conjecture, On 3-colorable planar graphs without cycles of four lengths, Short proofs of coloring theorems on planar graphs, On 3-colorable planar graphs without prescribed cycles, Planar graphs without 4, 6, 8-cycles are 3-colorable, A 3-color theorem on plane graphs without 5-circuits, 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
