TY - GEN

T1 - Efficiently four-coloring planar graphs

AU - Robertson, Neil

AU - Sanders, Daniel P.

AU - Seymour, Paul

AU - Thomas, Robin

N1 - Funding Information:
I Research partially performed under Bellcore, partially supported by DIMACS New Brunswick, New Jersey 08903, USA, NSF grant no. DMS-8903132 and ONR grant ‘Research supported by DIMACS and ONR 1-0325. 3 Research partially performed under Bellcore, partially supported by DIMACS, NSF grant no. DMS-9303761 and ONR a consulting agreement with Center, Rutgers University, and partially supported no. NOO014-92-J-1965. grant no. NOOO14-93-
Publisher Copyright:
© 1996 ACM.

PY - 1996/7/1

Y1 - 1996/7/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029698596&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029698596&partnerID=8YFLogxK

U2 - 10.1145/237814.238005

DO - 10.1145/237814.238005

M3 - Conference contribution

AN - SCOPUS:0029698596

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 571

EP - 575

BT - Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996

PB - Association for Computing Machinery

T2 - 28th Annual ACM Symposium on Theory of Computing, STOC 1996

Y2 - 22 May 1996 through 24 May 1996

ER -