Title of article :
A Strengthening of Brooksʹ Theorem
Author/Authors :
Reed، نويسنده , , Bruce، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1999
Abstract :
We show that for sufficiently large Δ, any graph with maximum degree at most Δ and no cliques of size Δ has a Δ−1 colouring
Journal title :
Journal of Combinatorial Theory Series B
Journal title :
Journal of Combinatorial Theory Series B
