Petr A. Golovach, Daniël Paulusma, Jian Song. Closing Complexity Gaps for Coloring Problems on H-Free Graphs. In Kun-Mao Chao, Tsan-sheng Hsu, Der-Tsai Lee, editors, Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings. Volume 7676 of Lecture Notes in Computer Science, pages 14-23, Springer, 2012. [doi]
Abstract is missing.