GRAPH COLOURING PROBLEMS AND THEIR APPLICATIONS IN SCHEDULING

Authors

  • Dániel Marx

Abstract

Graph colouring and its generalizations are useful tools in modelling a wide variety of scheduling and assignment problems. In this paper we review several variants of graph colouring, such as precolouring extension, list colouring, multicolouring, minimum sum colouring, and discuss their applications in scheduling.

Keywords:

scheduling, colouring, precolouring extension, list colouring, multicolouring, minimum sum colouring

How to Cite

Marx, D. “GRAPH COLOURING PROBLEMS AND THEIR APPLICATIONS IN SCHEDULING”, Periodica Polytechnica Electrical Engineering, 48(1-2), pp. 11–16, 2004.

Issue

Vol. 48 No. 1-2 (2004)

Section

Articles