Further extensions of the Grötzsch theorem
From MaRDI portal
Publication:2124638
DOI10.1016/j.disc.2022.112849zbMath1486.05093arXiv2110.01862OpenAlexW4213290189WikidataQ113877030 ScholiaQ113877030MaRDI QIDQ2124638
Hoang La, Borut Lužar, Kenny Štorgel
Publication date: 11 April 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.01862
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Steinberg's conjecture is false
- Ore's conjecture for \(k=4\) and Grötzsch's theorem
- Colorability of planar graphs with isolated nontriangular faces
- Planar 4-critical graphs with four triangles
- Adynamic coloring of graphs
- Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
- 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
- 3-coloring triangle-free planar graphs with a precolored 9-cycle
- Three colorability characterized by shrinking of locally connected subgraphs into triangles
- A Brooks-type result for sparse critical graphs
- Colorings of plane graphs: a survey
- Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies
- Note on 3-choosability of planar graphs with maximum degree 4
- 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
- The color space of a graph
- On a conjecture of B. Grünbaum
This page was built for publication: Further extensions of the Grötzsch theorem
