Funder
National Natural Science Foundation of China
Natural Science Foundation of Shandong Province
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference18 articles.
1. The strong chromatic index of a cubic graph is at most 10;Andersen;Discrete Math.,1992
2. . Bonamy, . Perrett, . Postle, Colouring graphs with sparse neighbourhoods, Bounds and Applications, submitted for publication.
3. Strong edge-coloring of graphs with maximum degree 4 using 22 colors;Cranston;Discrete Math.,2006
4. Strong list-chromatic of subcubic graphs;Dai;Discrete Math.,2018
5. Problems and results in combinatorial analysis ang graph theory;Erdős;Discrete Math.,1988
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献