Closing complexity gaps for coloring problems on H-free graphs

Petr A. Golovach, Daniƫl Paulusma, Jian Song. Closing complexity gaps for coloring problems on H-free graphs. Inf. Comput., 237:204-214, 2014. [doi]

Abstract

Abstract is missing.