Erratum: The average degree of an edge-chromatic critical graph II期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

按检索

Erratum: The average degree of an edge-chromatic critical graph II

Authors:	Douglas R Woodall

Institution:	School of Mathematical Sciences, University of Nottingham, Nottingham, United Kingdom

Abstract:	In the article “The average degree of an edge-chromatic critical graph II” by Douglas R. Woodall (J. Graph Theory 56 (2007), 194-218), it was claimed that the average degree of an edge-chromatic critical graph with maximum degree $Δ$ is at least $??? \frac{2}{3} ? (Δ + 1)$ if $Δ ? 2$ , at least $?+? \frac{2}{3} ? Δ + 1$ if $Δ ? 8$ , and at least $??? \frac{2}{3} ? (Δ + 2)$ if $Δ ? 15$ . Unfortunately there were mistakes in the proof of the last two of these results, which are now proved only if $Δ ? 18$ and $Δ ? 30$ , respectively.

Keywords:	average degree edge coloring edge-chromatic critical graph