The four-colour theorem
From MaRDI portal
Publication:1369648
DOI10.1006/jctb.1997.1750zbMath0883.05056MaRDI QIDQ1369648
Neil Robertson, Robin Thomas, Daniel P. Sanders, P. D. Seymour
Publication date: 16 March 1998
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9a7262c7bb5e43d913bd6de2bf71fea9646565f2
05C15: Coloring of graphs and hypergraphs
Related Items
Bicubic planar maps, On cyclic colorings and their generalizations, On intersection representations of co-planar graphs, Fractional colouring and Hadwiger's conjecture, Edge colorings of graphs embeddable in a surface of low genus, Unnamed Item
Cites Work
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- A systematic approach to the determination of reducible configurations in the four-color conjecture
- Every Planar Map is Four Colorable
- Another Reducible Edge Configuration
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item