Funder
National Natural Science Foundation of China
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference8 articles.
1. On an upper bound of a graph's chromatic number, depending on the graph's degree and density;Borodin;J. Comb. Theory, Ser. B,1997
2. On Colouring the Nodes of a Network;Brooks,1941
3. Embedding subgraphs and coloring graphs under extremal degree conditions;Catlin,1976
4. Coloring {P5,gem}-free graphs with Δ−1 colors;Cranston;J. Graph Theory,2022
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献