Title of article
On Total Colorings of Graphs
Author/Authors
Mcdiarmid، نويسنده , , C. S. Reed، نويسنده , , B.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1993
Pages
9
From page
122
To page
130
Abstract
We show that as n → ∞ the proportion of graphs on vertices 1, 2, ..., n with total chromatic number χ″ > Δ + 1 is very small; and the proportion with χ″ > Δ + 2 is very very small. Here Δ denotes the maximum vertex degree. We also give an easy new deterministic upper bound on χ″ (proved randomly).
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1993
Journal title
Journal of Combinatorial Theory Series B
Record number
1525707
Link To Document