The Complexity of the Four Colour Theorem

@inproceedings{Calude2010TheCO,
  title={The Complexity of the Four Colour Theorem},
  author={Cristian S. Calude and Elena Calude},
  year={2010}
}
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
BETA

References

Publications referenced by this paper.
SHOWING 1-10 OF 18 REFERENCES

A new measure of the difficulty of problems

  • E. Calude C. S. Calude, M. J. Dinneen
  • Part 2 , Complex Systems
  • 2010

The Four Color Theorem, http://www.math.gatech

  • N. Robertson, D. P. Sanders, P. Seymour, R. Thomas
  • edu/~thomas/FC/fourcolor.html (accessed on
  • 2008
2 Excerpts

Proving and programming

  • C. S. Calude
  • Bull . EATCS
  • 2004

Mathematics through the glasses of Hjelmslev’s semiotics, Semiotica

  • S. Marcus
  • 2003
1 Excerpt

Similar Papers

Loading similar papers…