Critical chromatic number and the complexity of perfect packings in graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Daniela Kühn' in GoogleThis author has not been identified. Look up 'Deryk Osthus' in Google

runs on WebDSL