A systematic approach to the determination of reducible configurations in the four-color conjecture

DOI10.1016/0095-8956(78)90010-2zbMath0398.05034OpenAlexW1997609399MaRDI QIDQ1254328

Edward Reiner Swart, Frank Allaire

Publication date: 1978

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(78)90010-2

zbMATH Keywords

Minimal Planar Five Chromatic GraphReducible Configurations

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items

The four-colour theorem, Every planar map is four colorable, The four-color theorem for small maps, An unavoidable set of configurations in planar trigangulations, Unnamed Item, The four color proof suffices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An existence theorem for planar maps
• A Case of Coloration in the Four Color Problem
• Six-Rings in Minimal Five-Color Maps
• Chromatic Polynomials