A note on the three color problem
From MaRDI portal
Publication:1805376
DOI10.1007/BF01787424zbMath0824.05023MaRDI QIDQ1805376
Publication date: 11 May 1995
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (max. 100)
A Steinberg-like approach to describing faces in 3-polytopes ⋮ Three-coloring planar graphs without short cycles ⋮ On 3-colorable planar graphs without cycles of four lengths ⋮ A 3-color theorem on plane graphs without 5-circuits ⋮ Steinberg's conjecture is false ⋮ A non-3-choosable planar graph without cycles of length 4 and 5 ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6 ⋮ A step towards the strong version of Havel's three color conjecture ⋮ Every signed planar graph without cycles of length from 4 to 8 is 3-colorable ⋮ Circular coloring and fractional coloring in planar graphs ⋮ Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable ⋮ Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable ⋮ Unnamed Item ⋮ Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph ⋮ Unnamed Item ⋮ Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests ⋮ \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9 ⋮ On 3-choosability of plane graphs without 6-, 7- and 9-cycles ⋮ A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits ⋮ On 3-colorable planar graphs without prescribed cycles ⋮ Distance constraints on short cycles for 3-colorability of planar graphs ⋮ The 3-colorability of planar graphs without cycles of length 4, 6 and 9 ⋮ An introduction to the discharging method via graph coloring ⋮ Planar graphs without 4, 6, 8-cycles are 3-colorable ⋮ A Complexity Dichotomy for the Coloring of Sparse Graphs ⋮ Planar graphs without cycles of length from 4 to 7 are 3-colorable ⋮ Unnamed Item ⋮ A note on list improper coloring planar graphs ⋮ On 3-colorings of plane graphs ⋮ Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable ⋮ On 3-colorability of planar graphs without adjacent short cycles ⋮ Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable ⋮ On 3-colorable planar graphs without short cycles ⋮ 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 ⋮ 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 ⋮ \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) ⋮ On the 3-colorability of planar graphs without 4-, 7- and 9-cycles ⋮ Planar graphs without adjacent cycles of length at most seven are 3-colorable ⋮ A note on 3-choosability of planar graphs without certain cycles ⋮ A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles
Cites Work
This page was built for publication: A note on the three color problem
