UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Four-coloring P6-free graphs

Thumbnail Image

Files

four-coloring.pdf (796.65 KB)

Date

2019

Authors

Chudnovsky, Maria
Spirkl, Sophie
Zhong, Mingxian

Journal Title

Journal ISSN

Volume Title

Publisher

Association for Computing Machinery

Abstract

In this paper we present a polynomial time algorithm for the 4-COLORING PROBLEM and the 4-PRECOLORING EXTENSION problem restricted to the class of graphs with no induced six-vertex path, thus proving a conjecture of Huang. Combined with previously known results this completes the classification of the complexity of the 4-coloring problem for graphs with a connected forbidden induced subgraph.

Description

© Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong | ACM} 2019. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms, https://doi.org/10.1137/1.9781611975482.76

Keywords

colouring, forbidden induced subgraph

LC Keywords

Citation

URI

https://doi.org/10.1137/1.9781611975482.76
 http://hdl.handle.net/10012/18545

Collections

Waterloo Research
Combinatorics and Optimization