Browsing Mathematics (Faculty of) by Subject "polynomial algorithm"
Now showing items 1-1 of 1
-
List 3-Coloring Graphs with No Induced P6+rP3
(Springer Nature, 2021-01-01)For an integer t, we let Pt denote the t-vertex path. We write H+G for the disjoint union of two graphs H and G, and for an integer r and a graph H, we write rH for the disjoint union of r copies of H. We say that a graph ...