Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference17 articles.
1. Benedict, J., Chinn, P.: On graphs having prescribed clique number, chromatic number, and maximum degree. In: Alavi, Y., Lick, D.R. (eds) Theory and Applications of Graphs (Proceedings, Michigan, May, 1976), vol. 64, pp. 132–140 (1978)
2. Borodin, O., Kostochka, A.: On an upper bound of a graph’s chromatic number depending on the graph’s degree and density. J. Combin. Theory Ser. B 23, 247–250 (1977)
3. Brooks, R.: On colouring the nodes of a network. Math. Proc. Camb. Philos. Soc. 37, 194–197 (1941)
4. Catlin, P.: Embedding subgraphs and coloring graphs under extremal degree conditions. Ph. D thesis, The Ohio State University (1976)
5. Cranston, D., Rabern, L.: Coloring claw-free graphs with $$\Delta - 1$$ colors. SIAM J. Discret. Math. 27(1), 534–549 (2013)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献