3-coloring triangle-free planar graphs with a precolored 9-cycle
From MaRDI portal
Publication:1678087
DOI10.1016/j.ejc.2017.07.010zbMath1373.05060arXiv1709.09428OpenAlexW2550344496MaRDI QIDQ1678087
Přemysl Holub, Bernard Lidický, Ilkyoo Choi, Jan Ekstein
Publication date: 14 November 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.09428
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.
- Planar 4-critical graphs with four triangles
- Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- A new proof of Grünbaum's 3 color theorem
- The four-colour theorem
- The chromatic number of a graph of girth 5 on a fixed surface
- Colorings of plane graphs: a survey
- Short proofs of coloring theorems on planar graphs
- Continuation of a 3-coloring from a 7-face onto a plane graph without \(C_3\)
- Grötzsch's theorem on 3-colorings
- 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle
- Coloring graphs with fixed genus and girth
- 4-Critical Graphs on Surfaces Without Contractible $(\le\!4)$-Cycles
- A Contribution to the Theory of Chromatic Polynomials
