On a conjecture of B. Grünbaum

DOI10.1016/S0021-9800(69)80054-2MaRDI QIDQ5567010zbMATH OpenOpenAlexWikidataFDO

Authors Ivan Havel

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

zbMATH Keywords

topology

Cited in

(29)

• Every planar graph without adjacent cycles of length at most 8 is 3-choosable
• Adapted list coloring of planar graphs
• Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
• Further extensions of the Grötzsch theorem
• Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable
• Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk
• Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.
• Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable
• Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five
• Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable
• Note on 3-choosability of planar graphs with maximum degree 4
• Irreducible graphs in the Grünbaum-Havel 3-colour problem
• Bordeaux 3-color conjecture and 3-choosability
• Planar 4-critical graphs with four triangles
• Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs
• Decomposing a planar graph of girth 5 into an independent set and a forest
• Some counterexamples associated with the three-color problem
• 3-list-coloring graphs of girth at least five on surfaces
• On 3-colorings of plane graphs
• A relaxation of the Bordeaux conjecture
• Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
• Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains
• Distance constraints on short cycles for 3-colorability of planar graphs
• A step towards the strong version of Havel's three color conjecture
• Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies
• A sufficient condition for planar graphs to be 3-colorable
• Planar graphs without adjacent cycles of length at most seven are 3-colorable
• A Complexity Dichotomy for the Coloring of Sparse Graphs
• Short proofs of coloring theorems on planar graphs

This page was built for publication: On a conjecture of B. Grünbaum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5567010)