N. Brettell
List k-colouring P-free graphs: a mim-width perspective
Brettell, N.; Horsfield, J.; Munaro, A.; Paulusma, D.
Abstract
A colouring of a graph G = (V, E) is a mapping c : V → {1, 2, . . .} such that c(u) 6= c(v) for every two adjacent vertices u and v of G. The List k-Colouring problem is to decide whether a graph G = (V, E) with a list L(u) ⊆ {1, . . . , k} for each u ∈ V has a colouring c such that c(u) ∈ L(u) for every u ∈ V . Let Pt be the path on t vertices and let K1 1,s be the graph obtained from the (s + 1)-vertex star K1,s by subdividing each of its edges exactly once. Recently, Chudnovsky, Spirkl and Zhong (DM 2020) proved that List 3-Colouring is polynomialtime solvable for (K1 1,s, Pt)-free graphs for every t ≥ 1 and s ≥ 1. We generalize their result to List k-Colouring for every k ≥ 1. Our result also generalizes the known result that for every k ≥ 1 and s ≥ 0, List k-Colouring is polynomial-time solvable for (sP1 + P5)-free graphs, which was proven for s = 0 by Hoàng, Kamiński, Lozin, Sawada, and Shu (Algorithmica 2010) and for every s ≥ 1 by Couturier, Golovach, Kratsch and Paulusma (Algorithmica 2015). We show our result by proving boundedness of an underlying width parameter. Namely, we show that for every k ≥ 1, s ≥ 1, t ≥ 1, the class of (Kk, K1 1,s, Pt)-free graphs has bounded mim-width and that a corresponding branch decomposition is “quickly computable” for these graphs.
Citation
Brettell, N., Horsfield, J., Munaro, A., & Paulusma, D. (2022). List k-colouring P-free graphs: a mim-width perspective. Information Processing Letters, 173, Article 106168. https://doi.org/10.1016/j.ipl.2021.106168
Journal Article Type | Article |
---|---|
Acceptance Date | Jul 13, 2021 |
Online Publication Date | Jul 21, 2021 |
Publication Date | 2022-01 |
Deposit Date | Aug 23, 2021 |
Publicly Available Date | Jul 22, 2023 |
Journal | Information Processing Letters |
Print ISSN | 0020-0190 |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 173 |
Article Number | 106168 |
DOI | https://doi.org/10.1016/j.ipl.2021.106168 |
Public URL | https://durham-repository.worktribe.com/output/1242409 |
Files
Accepted Journal Article
(408 Kb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by-nc-nd/4.0/
Copyright Statement
© 2021 This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
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