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

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996 |

Publisher | Association for Computing Machinery |

Pages | 571-575 |

Number of pages | 5 |

ISBN (Electronic) | 0897917855 |

DOIs | |

State | Published - Jul 1 1996 |

Externally published | Yes |

Event | 28th Annual ACM Symposium on Theory of Computing, STOC 1996 - Philadelphia, United States Duration: May 22 1996 → May 24 1996 |

### Publication series

Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
---|---|

Volume | Part F129452 |

ISSN (Print) | 0737-8017 |

### Other

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

Country | United States |

City | Philadelphia |

Period | 5/22/96 → 5/24/96 |

### All Science Journal Classification (ASJC) codes

- Software

## Fingerprint Dive into the research topics of 'Efficiently four-coloring planar graphs'. Together they form a unique fingerprint.

## Cite this

Robertson, N., Sanders, D. P., Seymour, P. D., & Thomas, R. (1996). Efficiently four-coloring planar graphs. In

*Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996*(pp. 571-575). (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. Part F129452). Association for Computing Machinery. https://doi.org/10.1145/237814.238005