Title of article
The Four-Colour Theorem
Author/Authors
Robertson، نويسنده , , Neil and Sanders، نويسنده , , Daniel and Seymour، نويسنده , , Paul and Thomas، نويسنده , , Robin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
43
From page
2
To page
44
Abstract
The four-colour theorem, that every loopless planar graph admits a vertex-colouring with at most four different colours, was proved in 1976 by Appel and Haken, using a computer. Here we give another proof, still using a computer, but simpler than Appel and Hakenʹs in several respects.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1997
Journal title
Journal of Combinatorial Theory Series B
Record number
1526237
Link To Document