Author:
Matula David W.,Marble George,Isaacson Joel D.
Reference11 articles.
1. Bounds for the chromatic number of a graph;Bondy;J. Combinatorial Theory,1969
2. On coloring the nodes of a network;Brooks;Proc. Cambridge Philos. Soc.,1941
3. The preparation of examination time-tables using a small-store computer;Cole;Comput. J.,1964
4. Majorants of the chromatic number of a random graph;Holgate;J. Roy. Statist. Soc. Ser. B,1969
5. A min-max theorem for graphs with application to graph coloring;Matula;SIAM Rev.,1968
Cited by
76 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献