On a conjecture of B. Grünbaum
From MaRDI portal
Publication:5567010
DOI10.1016/S0021-9800(69)80054-2zbMath0177.26805OpenAlexW2086425880WikidataQ123154775 ScholiaQ123154775MaRDI QIDQ5567010
Publication date: 1969
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(69)80054-2
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. ⋮ Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains ⋮ Irreducible graphs in the Grünbaum-Havel 3-colour problem ⋮ A step towards the strong version of Havel's three color conjecture ⋮ Some counterexamples associated with the three-color problem ⋮ Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable ⋮ A sufficient condition for planar graphs to be 3-colorable ⋮ Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five ⋮ Short proofs of coloring theorems on planar graphs ⋮ 3-list-coloring graphs of girth at least five on surfaces ⋮ Distance constraints on short cycles for 3-colorability of planar graphs ⋮ A Complexity Dichotomy for the Coloring of Sparse Graphs ⋮ Bordeaux 3-color conjecture and 3-choosability ⋮ 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 4-cycles and close triangles are \((2,0,0)\)-colorable ⋮ Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable ⋮ Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk ⋮ 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 ⋮ Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs ⋮ Planar 4-critical graphs with four triangles ⋮ Decomposing a planar graph of girth 5 into an independent set and a forest ⋮ Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable ⋮ Adapted list coloring of planar graphs ⋮ Every planar graph without adjacent cycles of length at most 8 is 3-choosable ⋮ Note on 3-choosability of planar graphs with maximum degree 4 ⋮ Planar graphs without adjacent cycles of length at most seven are 3-colorable ⋮ A relaxation of the Bordeaux conjecture
This page was built for publication: On a conjecture of B. Grünbaum
