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

Simple item page
dc.contributor.authorChudnovsky, Maria
dc.contributor.authorSpirkl, Sophie
dc.contributor.authorZhong, Mingxian
dc.date.accessioned2022-08-15T16:17:20Z
dc.date.available2022-08-15T16:17:20Z
dc.date.issued2019
dc.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.76en
dc.description.abstractIn 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.en
dc.description.sponsorshipSupported by NSF grant DMS-1550991 and US Army Research Office grant W911NF-16-1-0404.en
dc.identifier.urihttps://doi.org/10.1137/1.9781611975482.76
dc.identifier.urihttp://hdl.handle.net/10012/18545
dc.language.isoenen
dc.publisherAssociation for Computing Machineryen
dc.subjectcolouringen
dc.subjectforbidden induced subgraphen
dc.titleFour-coloring P6-free graphsen
dc.typeBook Chapteren
dcterms.bibliographicCitationChudnovsky, M., Spirkl, S., & Zhong, M. (2019). Four-coloring P6-free graphs. In Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 1239–1256). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975482.76en
uws.contributor.affiliation1Faculty of Mathematicsen
uws.contributor.affiliation2Combinatorics and Optimizationen
uws.peerReviewStatusRevieweden
uws.scholarLevelFacultyen
uws.typeOfResourceTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
four-coloring.pdf
Size:
796.65 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
4.47 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Waterloo Research
Combinatorics and Optimization