Browsing Waterloo Research by Author "Schaudt, Oliver"
Now showing items 1-3 of 3
-
Approximately Coloring Graphs Without Long Induced Paths
Chudnovsky, Maria; Schaudt, Oliver; Spirkl, Sophie; stein, maya; Zhong, Mingxian (Springer Nature, 2019)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 ... -
Approximately Coloring Graphs Without Long Induced Paths
Chudnovsky, Maria; Schaudt, Oliver; Spirkl, Sophie; stein, maya; Zhong, Mingxian (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 ... -
Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable
Chudnovsky, Maria; Liu, Chun-Hung; Schaudt, Oliver; Spirkl, Sophie; Trotignon, Nicolas; Vušković, Kristina (Wiley, 2019-10)We show that triangle-free graphs that do not contain an induced subgraph isomorphic to a subdivision of K4 are 3-colorable. This proves a conjecture of Trotignon and Vušković.