P.A. Golovach
Coloring graphs without short cycles and long induced paths
Golovach, P.A.; Paulusma, D.; Song, J.
Abstract
For an integer k≥1, a graph G is k-colorable if there exists a mapping c:VG→{1,…,k} such that c(u)≠c(v) whenever u and v are two adjacent vertices. For a fixed integer k≥1, the k-Coloring problem is that of testing whether a given graph is k-colorable. The girth of a graph G is the length of a shortest cycle in G. For any fixed g≥4 we determine a lower bound ℓ(g), such that every graph with girth at least g and with no induced path on ℓ(g) vertices is 3-colorable. We also show that for all fixed integers k,ℓ≥1, thek-Coloring problem can be solved in polynomial time for graphs with no induced cycle on four vertices and no induced path on ℓ vertices. As a consequence, for all fixed integers k,ℓ≥1 and g≥5, the k-Coloring problem can be solved in polynomial time for graphs with girth at least g and with no induced path on ℓ vertices. This result is best possible, as we prove the existence of an integer ℓ∗, such that already 4-Coloring is NP-complete for graphs with girth 4 and with no induced path on ℓ∗ vertices.
Citation
Golovach, P., Paulusma, D., & Song, J. (2014). Coloring graphs without short cycles and long induced paths. Discrete Applied Mathematics, 167, 107-120. https://doi.org/10.1016/j.dam.2013.12.008
Journal Article Type | Article |
---|---|
Publication Date | Apr 1, 2014 |
Deposit Date | Dec 20, 2014 |
Publicly Available Date | Jan 6, 2015 |
Journal | Discrete Applied Mathematics |
Print ISSN | 0166-218X |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 167 |
Pages | 107-120 |
DOI | https://doi.org/10.1016/j.dam.2013.12.008 |
Keywords | Graph coloring, Girth, Forbidden induced subgraph |
Public URL | https://durham-repository.worktribe.com/output/1417545 |
Files
Accepted Journal Article
(370 Kb)
PDF
Copyright Statement
NOTICE: this is the author’s version of a work that was accepted for publication in Discrete applied mathematics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Discrete applied mathematics, 167, 2014, 10.1016/j.dam.2013.12.008
You might also like
Matching cuts in graphs of high girth and H-free graphs
(2023)
Conference Proceeding
Solving problems on generalized convex graphs via mim-width
(2023)
Journal Article
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
(2023)
Journal Article
Computing Subset Vertex Covers in H-Free Graphs
(2023)
Conference Proceeding
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius
(2023)
Conference Proceeding
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search