Francis Guthrie's approach to The Four Color Problem

2018/04/12 by Asbjørn Brændeland, Brændeland, Asbjørn
Computer Science · Mathematics · #Advanced Graph Theory Research #Art #FOS: Mathematics #General Mathematics (math.GM) #Graph Labeling and Dimension Problems #math.GM

paper · pdf · doi:10.48550/arxiv.1804.04658

4 pages, 9 figures

arxiv created 2018/04/12 · openalex publication_date 2018/04/12 · arxiv updated 2018/04/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The odd wheel is the only type of 4-critical graph in which one vertex always gets a unique color. This supports Frederic Guthrie's approach to the Four Color Problem.

Citations

• Color identical pairs in 4-chromatic graphs

Related

• A Simple Proof for the Four-Color Theorem
• Mathematical Proofs of Two Conjectures: The Four Color Problem and The Uniquely 4-colorable Planar Graph
• A formal proof of the four color theorem
• Spiral Chains: A New Proof of the Four Color Theorem
• Excluding 4-wheels