Shenwei Huang, Matthew Johnson 0002, Daniël Paulusma. Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs. In Qianping Gu, Pavol Hell, Boting Yang, editors, Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings. Volume 8546 of Lecture Notes in Computer Science, pages 162-173, Springer, 2014. [doi]
Abstract is missing.