Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies
From MaRDI portal
Publication:2040020
DOI10.1016/j.jctb.2020.04.006zbMath1467.05072arXiv0911.0885OpenAlexW3022497439MaRDI QIDQ2040020
Robin Thomas, Daniel Král', Zdeněk Dvořák
Publication date: 6 July 2021
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.0885
Related Items (max. 100)
Further extensions of the Grötzsch theorem ⋮ Hyperbolic families and coloring graphs on surfaces ⋮ Fine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles ⋮ Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable ⋮ Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces ⋮ Three-coloring triangle-free graphs on surfaces. VI: 3-colorability of quadrangulations ⋮ 3-list-coloring graphs of girth at least five on surfaces ⋮ Large Independent Sets in Triangle-Free Planar Graphs
Cites Work
- Planar 4-critical graphs with four triangles
- Many 3-colorings of triangle-free planar graphs
- Irreducible graphs in the Grünbaum-Havel 3-colour problem
- Some counterexamples associated with the three-color problem
- You can't paint yourself into a corner
- A new proof of Grünbaum's 3 color theorem
- A sufficient condition for planar graphs to be 3-colorable
- Three-coloring Klein bottle graphs of girth five
- A step towards the strong version of Havel's three color conjecture
- 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart
- Grötzsch's theorem on 3-colorings
- 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle
- Three-coloring triangle-free planar graphs in linear time
- Coloring graphs with fixed genus and girth
- Hyperbolic families and coloring graphs on surfaces
- Fine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles
- On a conjecture of B. Grünbaum
- A Contribution to the Theory of Chromatic Polynomials
This page was built for publication: Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies
