scientific article; zbMATH DE number 7771741

zbMath1524.05105arXiv2203.08136MaRDI QIDQ6072056

Vincent R. Vatter, Zachary Hamaker

Publication date: 29 November 2023

Full work available at URL: https://arxiv.org/abs/2203.08136

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Ore's conjecturethree coloring conjecture

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Cites Work

• Steinberg's conjecture is false
• Ore's conjecture for \(k=4\) and Grötzsch's theorem
• Ore's conjecture on color-critical graphs is almost true
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• A note on the three color problem
• Short proofs of coloring theorems on planar graphs
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: