论文信息 - GRAPH COLORING ALGORITHMS - 字舞流文

GRAPH COLORING ALGORITHMS

David W. Matula | George Marble | Joel D. Isaacson | D. Matula | G. Marble | J. D. Isaacson

[1] D. Matula. k-Components, Clusters and Slicings in Graphs , 1972 .

[2] P. Holgate. Majorants of the Chromatic Number of a Random Graph , 1969 .

[3] J. Bondy. Bounds for the chromatic number of a graph , 1969 .

[4] David C. Wood,et al. A technique for colouring a graph applicable to large scale timetabling problems , 1969, Computer/law journal.

[5] G. Szekeres,et al. An inequality for the chromatic number of a graph , 1968 .

[6] D. J. A. Welsh,et al. An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..

[7] A. J. Cole,et al. The preparation of examination time-tables using a small-store computer , 1964, Comput. J..

[8] R. L. Brooks. On Colouring the Nodes of a Network , 1941 .