Show simple item record

dc.contributor.authorChudnovsky, Maria
dc.contributor.authorSchaudt, Oliver
dc.contributor.authorSpirkl, Sophie
dc.contributor.authorstein, maya
dc.contributor.authorZhong, Mingxian 00:38:09 (GMT) 00:38:09 (GMT)
dc.descriptionThis is a post-peer-review, pre-copyedit version of an article published in Algorithmica. The final authenticated version is available online at:
dc.description.abstractIt is an open problem whether the 3-coloring problem can be solved in polynomial time in the class of graphs that do not contain an induced path on t vertices, for fixed t. We propose an algorithm that, given a 3-colorable graph without an induced path on t vertices, computes a coloring with max{5,2⌈t−12⌉−2} many colors. If the input graph is triangle-free, we only need max{4,⌈t−12⌉+1} many colors. The running time of our algorithm is O((3t−2+t2)m+n) if the input graph has n vertices and m edges.en
dc.description.sponsorshipThe first author was supported by National Science Foundation grant DMS-1550991 and US Army Research Office Grant W911NF-16-1-0404. The fourth author was supported by Fondecyt Grants 1140766 and 1180830, by CMM-Basal AFB 170001, and by Millennium Nucleus Information and Coordination in Networks.en
dc.publisherSpringer Natureen
dc.subjectgraph coloringen
dc.subjectforbidden induced pathsen
dc.subjectapproximation algorithmen
dc.titleApproximately Coloring Graphs Without Long Induced Pathsen
dcterms.bibliographicCitationChudnovsky, M., Schaudt, O., Spirkl, S. et al. Approximately Coloring Graphs Without Long Induced Paths. Algorithmica 81, 3186–3199 (2019).
uws.contributor.affiliation1Faculty of Mathematicsen
uws.contributor.affiliation2Combinatorics and Optimizationen

Files in this item


This item appears in the following Collection(s)

Show simple item record


University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages