ABSTRACT
Zsolt Tuza, University of Veszpre´m, Hungary
5.1.1 General Concepts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 408 5.1.2 Vertex Degrees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 412 5.1.3 Critical Graphs and Uniquely Colorable Graphs . . . . . . . . . . . . . . . . . 414 5.1.4 Girth and Clique Number . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 417 5.1.5 Edge-Coloring and χ-Binding Functions . . . . . . . . . . . . . . . . . . . . . . . . . 421 5.1.6 Coloring and Orientation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 426 5.1.7 Colorings of Infinite Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 428 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 430
INTRODUCTION
§5.1 concentrates on the classical concept of chromatic number and on the more recent but closely related concept of choice number, mostly in connection with other important graph invariants. Further developments of graph colorings appear in §5.2.
