English | 267 pages | North-Holland (1989-01-15) | 0444705333 | PDF | 13.81 Mb

Graph coloring has been a field of attraction for many years; a wide collectionof papers has been dedicated to the study of chromatic properties of graphs.Initially such problems were just a kind of game for pure mathematicians; itwas in particular the case of the famous four color problem. However, as peoplewere getting used to applying the tools of graph theory for solving real-lifeorganizational problems, chromatic models appeared as a quite natural way oftackling many situations. Among these are timetabling problems, or moregenerally scheduling with disjunctive constraints (pairwise incompatibility be-tween jobs), clustering in statistics, automatic classification, group technology inproduction (partitioning a collection of parts into families of parts which are assimilar as possible in their production process), VLSI design, etc.
[i][/i]





.