Title of article
k-Colouring when k is close to Δ
Author/Authors
Molloy، نويسنده , , Michael and Reed، نويسنده , , Bruce، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
4
From page
235
To page
238
Abstract
We discuss applications of a simple random colouring procedure, including a determination of the set of values k for which k-colourability of graphs with maximum degree Δ is NP-complete.
Keywords
Probabilistic method , Colouring
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2000
Journal title
Electronic Notes in Discrete Mathematics
Record number
1452875
Link To Document