Parameterized complexity of coloring problems: Treewidth versus vertex cover

Jirí Fiala, Petr A. Golovach, Jan Kratochvíl. Parameterized complexity of coloring problems: Treewidth versus vertex cover. Theoretical Computer Science, 412(23):2513-2523, 2011. [doi]

Abstract

Abstract is missing.