Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
From MaRDI portal
Publication:1338317
DOI10.1006/jctb.1994.1069zbMath0817.05024OpenAlexW2008383657MaRDI QIDQ1338317
Publication date: 29 November 1994
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1994.1069
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Superposition and constructions of graphs without nowhere-zero \(k\)-flows, On the dichromatic number of surfaces, Three-coloring Klein bottle graphs of girth five, Homomorphism bounded classes of graphs, 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, Unnamed Item, Colorings and girth of oriented planar graphs, Rainbowness of cubic plane graphs, Hyperbolic families and coloring graphs on surfaces, Group connectivity of bridged graphs, Do triangle-free planar graphs have exponentially many 3-colorings?, Facially-constrained colorings of plane graphs: a survey, Many 3-colorings of triangle-free planar graphs, Characterization of 4-critical triangle-free toroidal graphs, 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle, Fine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles, Fractional coloring of triangle-free planar graphs, A density bound for triangle‐free 4‐critical graphs, The chromatic number of a graph of girth 5 on a fixed surface, A short list color proof of Grötzsch's theorem, Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces, Flow extensions and group connectivity with applications, Group connectivity and group colorings of graphs --- a survey, Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five, Many Facets of Dualities, Short proofs of coloring theorems on planar graphs, Fast 3-coloring triangle-free planar graphs, Maximum face-constrained coloring of plane graphs, Colouring, constraint satisfaction, and complexity, Nowhere-zero 3-flows and modulo \(k\)-orientations, On maximum face-constrained coloring of plane graphs with no short face cycles., Coloring near-quadrangulations of the cylinder and the torus, Non-rainbow colorings of 3-, 4- and 5-connected plane graphs, Coloring graphs with fixed genus and girth, An introduction to the discharging method via graph coloring, Coloring even-faced graphs in the torus and the Klein bottle, Nowhere-zero 3-flows in triangularly connected graphs, The color space of a graph, What is on his mind?, Folding, Choosability of toroidal graphs without short cycles, Irreducible 4-critical triangle-free toroidal graphs, Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk, Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs, Large Independent Sets in Triangle-Free Planar Graphs, Proper colorings of plane quadrangulations without rainbow faces, EVERY N2-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z3-CONNECTED, Decomposing a planar graph of girth 5 into an independent set and a forest, Unnamed Item, Nowhere-zero 3-flows in toroidal graphs, Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs, Some of My Favorite Coloring Problems for Graphs and Digraphs, High-girth graphs avoiding a minor are nearly bipartite, Graph imperfection. I, Rainbowness of plane graphs, Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus
