Grötzsch's theorem on 3-colorings
From MaRDI portal
Publication:2625676
DOI10.1307/mmj/1028998916zbMath0115.40903MaRDI 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
05C15: Coloring of graphs and hypergraphs
Related Items
Acyclic colorings of planar graphs, Graph theory, On 3-choosable planar graphs of girth at least 4, Irreducible graphs in the Grünbaum-Havel 3-colour problem, Flows and generalized coloring theorems in graphs, Some counterexamples associated with the three-color problem, Nowhere-zero 3-flows of highly connected graphs, Some results in topological graph theory, Star chromatic number of triangle-free planar graphs, On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs, A new proof of Grünbaum's 3 color theorem, Superposition and constructions of graphs without nowhere-zero \(k\)-flows, Smaller planar triangle-free graphs that are not 3-list-colorable, Some combinatorial problems, A Five-Color Theorem for Graphs on Surfaces