scientific article
From MaRDI portal
Publication:4065568
zbMath0308.05107MaRDI QIDQ4065568
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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. ⋮ Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains ⋮ A new proof of Grünbaum's 3 color theorem ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Characterization of 4-critical triangle-free toroidal graphs ⋮ 3-coloring triangle-free planar graphs with a precolored 9-cycle ⋮ 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle ⋮ Some counterexamples associated with the three-color problem ⋮ Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces ⋮ Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five ⋮ 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart ⋮ Short proofs of coloring theorems on planar graphs ⋮ Smaller planar triangle-free graphs that are not 3-list-colorable ⋮ Maximal distance spectral radius of 4-chromatic planar graphs ⋮ Irreducible 4-critical triangle-free toroidal graphs ⋮ On uniquely 3-colorable planar graphs ⋮ Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs ⋮ Planar 4-critical graphs with four triangles ⋮ On 3-choosable planar graphs of girth at least 4 ⋮ Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces ⋮ Note on 3-choosability of planar graphs with maximum degree 4
This page was built for publication:
