"Vertex colouring and forbidden subgraphs - a survey"
Article by Bert Randerath, Ingo Schiermeyer, available as BibTeX Source, postscript file, compressed postscript file and in portable document format.
Zentrum für Angewandte Informatik Köln, Lehrstuhl Speckenmeyer
Preprint Key:	zaik2003-453
Keywords:	chi-binding function, colouring, forbidden subgraphs, graph algorithms, perfect graphs
MSC codes:	05C15, 05C17, 05C85, 68R10
This article was published in 2004 in the journal "Graphs & Combinatorics", volume 20, number 1, pages 1-40.
Abstract:	There is a great variety of colouring concepts and results in the literature. Here our focus is to survey results on vertex colourings of graphs defined in terms of forbidden induced subgraph conditions.