A list version of Dirac's theorem on the number of edges in colour-critical graphs

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 of this r...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of graph theory 2002-03, Vol.39 (3), p.165-177
Hauptverfasser:	Kostochka, Alexandr V., Stiebitz, Michael
Format:	Artikel
Sprache:	eng
Schlagworte:	critical graphs list colourings
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!