Highly Influenced

4 Excerpts

@inproceedings{Calude2010TheCO, title={The Complexity of the Four Colour Theorem}, author={Cristian S. Calude and Elena Calude}, year={2010} }

- Published 2010
DOI:10.1112/S1461157009000461

The four colour theorem states that the vertices of every planar graph can be coloured with at most four colours so that no two adjacent vertices receive the same colour. This theorem is famous for many reasons, including the fact that its original 1977 proof includes a non-trivial computer verification. Recently, a formal proof of the theorem was obtained with the equational logic program Coq [14]. In this paper we describe an implementation of the computational method introduced in [7, 5] to… CONTINUE READING