## The four-color problem: assaults and conquest |

### What people are saying - Write a review

#### Review: The Four-Color Problem: Assaults and Conquest

User Review - Neil - GoodreadsIt would be enough to have the excellent history of the conjecture and explication of Appel & Haken's theorem, but the meaty discussion of outstanding questions in graph coloring is what really makes this volume shine. The work on the roots of chromials is especially great. Read full review

#### Review: The Four-Color Problem: Assaults and Conquest

User Review - GoodreadsIt would be enough to have the excellent history of the conjecture and explication of Appel & Haken's theorem, but the meaty discussion of outstanding questions in graph coloring is what really makes this volume shine. The work on the roots of chromials is especially great. Read full review

### Contents

Historical Setting | 3 |

Map Coloring | 21 |

Solution of the FourColor Problem | 52 |

Copyright | |

7 other sections not shown

### Other editions - View all

The Four-color Problem: Assaults and Conquest Thomas L. Saaty,Paul C. Kainen No preview available - 1986 |

### Common terms and phrases

adjacent Appel and Haken argument assigned bipartite boundary bridgeless cubic c-colorable called chain group chromatic number chromatic polynomials chromials chromodendron cographic coloring of G complete graph components Conjecture C4 connected graph Corollary corresponding cubic graph cubic map D-reducible define denote directed graph disconnecting set disjoint dual dual graph edges of G embedding endpoints equivalent Euler's formula example Figure finite five-color following theorem four four-color conjecture four-color theorem four-coloring of G G contains G is planar graph G Graph Theory hamiltonian circuit hamiltonian graph Heawood Hence homeomorphic induced integer isomorphic Kempe chains Kempe residues Lemma Let G loop mathematical maximal planar graph minimum number neighbors number of colors number of edges number of vertices obtained pair partition plane problem Proof Let prove reducible configurations regions result subgraph of G subset surface sw(G Tait-coloring three-colored topological tree triangulation Tutte unavoidable set vertex of degree Whitney