Critical chromatic number and the complexity of perfect packings in graphs

Research output: Contribution to conference (unpublished) › Paper

18 Citations (Scopus)

Original language	English
Pages	851-859
Number of pages	9
Publication status	Published - 1 Oct 2006
Event	17th ACM-SIAM Symposium on Discrete Algorithms 2006 - Duration: 1 Oct 2006 → …

Conference	17th ACM-SIAM Symposium on Discrete Algorithms 2006
Period	1/10/06 → …

Cite this

@conference{1830f79a2a154a549c462b553adbcb57,

title = "Critical chromatic number and the complexity of perfect packings in graphs",

author = "Deryk Osthus and Daniela Kuhn",

year = "2006",

month = oct,

day = "1",

language = "English",

pages = "851--859",

note = "17th ACM-SIAM Symposium on Discrete Algorithms 2006 ; Conference date: 01-10-2006",

}