An unavoidable set of $D$-reducible configurations

DOI10.1090/S0002-9947-2010-05092-5zbMath1221.05165arXiv0905.0043MaRDI QIDQ3065754

John P. Steinberger

Publication date: 6 January 2011

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

graph theoryfour-color theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Subcubic planar graphs of girth 7 are class I ⋮ The \(a\)-graph coloring problem

Cites Work

• The four-color theorem for small maps
• Every planar map is four colorable. I: Discharging
• The four-colour theorem
• Every Planar Map is Four Colorable
• Another Reducible Edge Configuration
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An unavoidable set of $D$-reducible configurations