The four-color theorem for small maps

DOI10.1016/0095-8956(75)90088-XzbMath0313.05109OpenAlexW2064142782MaRDI QIDQ1220082

Walter R. Stromquist

Publication date: 1975

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(75)90088-x

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Inégalités nouvelles dans le problème des quatre couleurs ⋮ Some remarks on E- minimal graphs ⋮ An unavoidable set of $D$-reducible configurations ⋮ The four color proof suffices

Cites Work

• A systematic approach to the determination of reducible configurations in the four-color conjecture
• Chromatic reduction of the triangulations \(T_e, e=e_5+e_7\)
• Numerical calculations on the four-color problem
• Unnamed Item
• Unnamed Item

This page was built for publication: The four-color theorem for small maps