Daniela Kühn, Deryk Osthus. Critical chromatic number and the complexity of perfect packings in graphs. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006. pages 851-859, ACM Press, 2006. [doi]
Abstract is missing.