Erratum: The average degree of an edge‐chromatic critical graph II
Douglas R. Woodall · Journal of Graph Theory · 2019
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 if , at least if , and at least if . Unfortunately there were mistakes in the proof of the last two of these results, which are now proved only if and , respectively.