The Algorithmic Complexity of k-Domatic Partition of Graphs

Hongyu Liang. The Algorithmic Complexity of k-Domatic Partition of Graphs. In Jos C. M. Baeten, Thomas Ball, Frank S. de Boer, editors, Theoretical Computer Science - 7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Amsterdam, The Netherlands, September 26-28, 2012. Proceedings. Volume 7604 of Lecture Notes in Computer Science, pages 240-249, Springer, 2012. [doi]

Abstract

Abstract is missing.