dc.contributor.author | Chudnovsky, Maria | |
dc.contributor.author | Schaudt, Oliver | |
dc.contributor.author | Spirkl, Sophie | |
dc.contributor.author | stein, maya | |
dc.contributor.author | Zhong, Mingxian | |
dc.date.accessioned | 2022-08-12 01:18:49 (GMT) | |
dc.date.available | 2022-08-12 01:18:49 (GMT) | |
dc.date.issued | 2017 | |
dc.identifier.uri | https://doi.org/10.1007/978-3-319-68705-6_15 | |
dc.identifier.uri | http://hdl.handle.net/10012/18536 | |
dc.description | This is a post-peer-review, pre-copyedit version of a conference paper published in Lecture Notes in Computer Science. The final authenticated version is available online at: https://doi.org/10.1007/978-3-319-68705-6_15 | en |
dc.description.abstract | It 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.sponsorship | Supported by NSF grant DMS-1550991. Supported by Fondecyt grant 1140766 and Millennium Nucleus Information and Coordination in Networks. | en |
dc.language.iso | en | en |
dc.publisher | Springer Nature | en |
dc.subject | induced paths | en |
dc.subject | colouring | en |
dc.title | Approximately Coloring Graphs Without Long Induced Paths | en |
dc.type | Conference Paper | en |
dcterms.bibliographicCitation | Chudnovsky, M., Schaudt, O., Spirkl, S., Stein, M., & Zhong, M. (2017). Approximately Coloring Graphs Without Long Induced Paths. In H. L. Bodlaender & G. J. Woeginger (Eds.), Graph-Theoretic Concepts in Computer Science (pp. 193–205). Springer International Publishing. https://doi.org/10.1007/978-3-319-68705-6_15 | en |
uws.contributor.affiliation1 | Faculty of Mathematics | en |
uws.contributor.affiliation2 | Combinatorics and Optimization | en |
uws.typeOfResource | Text | en |
uws.peerReviewStatus | Reviewed | en |
uws.scholarLevel | Faculty | en |