A list version of Dirac's theorem on the
โ
Alexandr V. Kostochka; Michael Stiebitz
๐
Article
๐
2002
๐
John Wiley and Sons
๐
English
โ 110 KB
๐ 2 views
## Abstract One of the basic results in graph colouring is Brooks' theorem [R. L. Brooks, Proc Cambridge Phil Soc 37 (1941) 194โ197], which asserts that the chromatic number of every connected graph, that is not a complete graph or an odd cycle, does not exceed its maximum degree. As an extension o