List 3-coloring Pt-free graphs with no induced 1-subdivision of K1,s
Loading...
Date
2020-11
Authors
Chudnovsky, Maria
Spirkl, Sophie
Zhong, Mingxian
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Abstract
Let s and t be positive integers. We use Pt to denote the path with t vertices and K1,s to
denote the complete bipartite graph with parts of size 1 and s respectively. The one-subdivision
of K1,s is obtained by replacing every edge {u, v} of K1,s by two edges {u, v} and {u, v} with a
new vertex w. In this paper, we give a polynomial-time algorithm for the list 3-coloring problem
restricted to the class of Pt-free graph with no induced 1-subdivision of K1,s.
Description
The final publication is available at Elsevier via https://doi.org/10.1016/j.disc.2020.112086 © 2020. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
Keywords
coloring, forbidden induced subgraphs, dominating set