Grötzsch's theorem on 3-colorings
From MaRDI portal
Publication:2625676
DOI10.1307/mmj/1028998916zbMath0115.40903OpenAlexW2040131838MaRDI QIDQ2625676
Publication date: 1963
Published in: Michigan Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1307/mmj/1028998916
Related Items
Superposition and constructions of graphs without nowhere-zero \(k\)-flows, A Five-Color Theorem for Graphs on Surfaces, Further extensions of the Grötzsch theorem, Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle., Modulo orientations and matchings in graphs, Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains, Unnamed Item, On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs, A new proof of Grünbaum's 3 color theorem, On \(t\)-common list-colorings, Facially-constrained colorings of plane graphs: a survey, Irreducible graphs in the Grünbaum-Havel 3-colour problem, 3-coloring triangle-free planar graphs with a precolored 9-cycle, 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle, Flows and generalized coloring theorems in graphs, New restrictions on defective coloring with applications to Steinberg-type graphs, Some counterexamples associated with the three-color problem, All complete graph-wheel planar Ramsey numbers, Group connectivity and group colorings of graphs --- a survey, QUADRILATERAL-TREE PLANAR RAMSEY NUMBERS, Short proofs of coloring theorems on planar graphs, Nowhere-zero 3-flows and modulo \(k\)-orientations, The planar Ramsey number \(\mathrm{PR}(C_4,K_8)\), Nowhere-zero 3-flows of highly connected graphs, All quadrilateral-wheel planar Ramsey numbers, Smaller planar triangle-free graphs that are not 3-list-colorable, Acyclic colorings of planar graphs, Maximal distance spectral radius of 4-chromatic planar graphs, Some results in topological graph theory, Graph theory, Complete graph-tree planar Ramsey numbers, Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies, Some combinatorial problems, 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, Adynamic coloring of graphs, Some of My Favorite Coloring Problems for Graphs and Digraphs, Star chromatic number of triangle-free planar graphs
