Funder
National Natural Science Foundation of China
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference16 articles.
1. On an upper bound of a graph’s chromatic number, depending on the graph’s degree and density;Borodin;J. Combin. Theory Ser. B,1977
2. On coloring the nodes of a network;Brooks,1941
3. Embedding Subgraphs and Coloring Graphs under Extremal Degree Conditions;Catlin,1976
4. The strong perfect graph theorem;Chudnovsky;Ann. of Math.,2006
5. Coloring {P5,gem}-free graphs with Δ−1 colors;Cranston;J. Graph Theory,2022
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献