Approximately Coloring Graphs Without Long Induced Paths
| 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-12T00:38:09Z | |
| dc.date.available | 2022-08-12T00:38:09Z | |
| dc.date.issued | 2019 | |
| dc.description | This is a post-peer-review, pre-copyedit version of an article published in Algorithmica. The final authenticated version is available online at: https://doi.org/10.1007/s00453-019-00577-6 | 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 | The 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.identifier.uri | https://doi.org/10.1007/s00453-019-00577-6 | |
| dc.identifier.uri | http://hdl.handle.net/10012/18519 | |
| dc.language.iso | en | en |
| dc.publisher | Springer Nature | en |
| dc.subject | graph coloring | en |
| dc.subject | forbidden induced paths | en |
| dc.subject | approximation algorithm | en |
| dc.title | Approximately Coloring Graphs Without Long Induced Paths | en |
| dc.type | Article | en |
| dcterms.bibliographicCitation | Chudnovsky, M., Schaudt, O., Spirkl, S. et al. Approximately Coloring Graphs Without Long Induced Paths. Algorithmica 81, 3186–3199 (2019). https://doi.org/10.1007/s00453-019-00577-6 | en |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.contributor.affiliation2 | Combinatorics and Optimization | en |
| uws.peerReviewStatus | Reviewed | en |
| uws.scholarLevel | Faculty | en |
| uws.typeOfResource | Text | en |