AbstractThe 4-color theorem was proved by showing that a minimum counterexample cannot exist. Birkhoff demonstrated that a minimum counterexample must be internally 6-connected. We show that a minimum counterexample must also satisfy a coloring property that we call Kempe-locking. The novel idea explored in this article is that the connectivity and coloring properties are incompatible. We describe a methodology for analyzing whether an arbitrary planar triangulation is Kempe-locked. We provide a heuristic argument that a fundamental Kempe-locking configuration must be of low order and then perform a systematic search through isomorphism classes for such configurations. All Kempe-locked triangulations that we discovered have two features in common: (1) they are Kempe-locked with respect to only a single edge, say
Share & Cite This Article
Tilley, J. Kempe-Locking Configurations. Mathematics 2018, 6, 309.
Tilley J. Kempe-Locking Configurations. Mathematics. 2018; 6(12):309.Chicago/Turabian Style
Tilley, James. 2018. "Kempe-Locking Configurations." Mathematics 6, no. 12: 309.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.