ISBN-13: 9780821828120 / Angielski / Twarda / 2002
The theory of graph colouring has existed for more than 150 years. Historically, graph colouring involved finding the minimum number of colours to be assigned to the vertices so that adjacent vertices would have different colours. From this modest beginning, the theory has become central in discrete mathematics with many contemporary generalizations and applications.