Browsing Mathematics (Faculty of) by Subject "induced paths"
Now showing items 1-1 of 1
-
Approximately Coloring Graphs Without Long Induced Paths
(Springer Nature, 2017)It is an open problem whether the 3-coloring problem can be solved in polynomial time in the class of graphs that do not contain an induced path on t vertices, for fixed t. We propose an algorithm that, given a 3-colorable ...