@inproceedings{30aaa564d2d64442995152002ed2ba65,

title = "Efficiently four-coloring planar graphs",

abstract = "An outline of a quadratic algorithm to 4-color planar graphs is presented, based upon a new proof of the Four Color Theorem. This algorithm improves a quartic algorithm of Appel and Haken.",

author = "Neil Robertson and Sanders, {Daniel P.} and Paul Seymour and Robin Thomas",

note = "Publisher Copyright: {\textcopyright} 1996 ACM.; 28th Annual ACM Symposium on Theory of Computing, STOC 1996 ; Conference date: 22-05-1996 Through 24-05-1996",

year = "1996",

month = jul,

day = "1",

doi = "10.1145/237814.238005",

language = "English (US)",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "571--575",

booktitle = "Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996",

}