A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
List k-Colouring P_t-Free Graphs: a Mim-width Perspective
[article]
2021
arXiv
pre-print
A colouring of a graph G=(V,E) is a mapping c V→{1,2,...} such that c(u)≠ 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 P_t be the path on t vertices and let K_1,s^1 be the graph obtained from the (s+1)-vertex star K_1,s by subdividing each of its edges exactly once.Recently, Chudnovsky, Spirkl and Zhong (DM 2020) proved that
arXiv:2008.01590v2
fatcat:vkjvicp64bfvvlu2fssul32swi