Skip to main content
Log in

Vertex Colouring and Forbidden Subgraphs – A Survey

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript


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. Thus, one who wishes to obtain useful results from a graph coloring formulation of his problem must do more than just show that the problem is equivalent to the general problem of coloring a graph. If there is to be any hope, one must also obtain information about the structure of the graphs that need to be colored (D.S. Johnson [66]).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others


We thank Annegret Wagler, Meike Tewes and the anonymous referees for their valuable comments on this text.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Bert Randerath.

Additional information

Final version received: September 9, 2003

Rights and permissions

Reprints and permissions

About this article

Cite this article

Randerath, B., Schiermeyer, I. Vertex Colouring and Forbidden Subgraphs – A Survey. Graphs and Combinatorics 20, 1–40 (2004).

Download citation

  • Received:

  • Issue Date:

  • DOI: