Improved Complexity Results on k-Coloring P t -Free Graphs

Shenwei Huang. Improved Complexity Results on k-Coloring P t -Free Graphs. In Krishnendu Chatterjee, Jiri Sgall, editors, Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings. Volume 8087 of Lecture Notes in Computer Science, pages 551-558, Springer, 2013. [doi]

Abstract

Abstract is missing.