loading page

Kempe Chains in the maximal planar graphs without an impasse
  • I. Cahit
I. Cahit

Corresponding Author:[email protected]

Author Profile

Abstract

Abstract. Historically the flaw in Kempe’s argument in the proof of the four color map problem of Francis Guthrie have been pointed out by Heawood (also by de la Vallée Poussin). Another bad examples have been provided by A. Errera in 1921 and by I. Kittell in 1935. Despite the similar proofs of the four color theorem with the aid of an computer in the last quarter of 20th century Kempe chain remain the essential tool in the possible non-computer proof of this famous theorem. In this note we have given four color of Heawood, Errera and Kittell graphs which are based on, respectively hamiltonian cycle and path in the dual graphs of these bad examples. Particularly we have introduced spiral chains of a maximal planar graph which enable us to color any maximal planar graph with four colors.