Chromatic graph theory is a thriving area that uses various ideas of 'colouring' (of vertices, edges, and so on) to explore aspects of graph theory. It has links with other areas of mathematics, including topology, algebra and geometry, and is increasingly used in such areas as computer networks, where colouring algorithms form an important feature. While other books cover portions of the material, no other title has such a wide scope as this one, in which acknowledged international experts in the field provide a broad survey of the subject. All fifteen chapters have been carefully edited, with uniform notation and terminology applied throughout. Bjarne Toft (Odense, Denmark), widely recognized for his substantial contributions to the area, acted as academic consultant. The book serves as a valuable reference for researchers and graduate students in graph theory and combinatorics and as a useful introduction to the topic for mathematicians in related fields.9. Sports. scheduling. Another classical application of edgecolouring is the tournament scheduling problem. In its most elementary version we are given a league of 2n teams numbered from 1 to 2n, and each team has to play exactly one game against every other team. ... No team can play more than one game on each day, so the games that can be played on the same day form a matching in K2n. Thus, anbsp;...
|Title||:||Topics in Chromatic Graph Theory|
|Author||:||Lowell W. Beineke, Robin J. Wilson|
|Publisher||:||Cambridge University Press - 2015-05-07|