Browsing Waterloo Research by Subject "forbidden induced subgraphs"
Now showing items 1-1 of 1
-
List 3-coloring Pt-free graphs with no induced 1-subdivision of K1,s
(Elsevier, 2020-11)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 ...