An upper bound for the chromatic number of a graph and its application to timetabling problems

D. J. A. Welsh, M. B. Powell. An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput. J., 10(1):85-86, 1967. [doi]

No reviews for this publication, yet.