Closing Complexity Gaps for Coloring Problems on H-Free Graphs.

Petr A. Golovach, Danil Paulusma, Jian Song

Browse the full ISAAC paper archive.