Funder
National Natural Science Foundation of China
Shandong Province Natural Science Foundation of China
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference24 articles.
1. On the list dynamic coloring of graphs;Akbari;Discrete Appl. Math.,2009
2. On the dynamic coloring of graphs;Alishahi;Discrete Appl. Math.,2011
3. 2-distance coloring of sparse graphs;Bonamy;J. Graph Theory,2014
4. Graph Theory;Bondy,2008
5. Sufficient conditions for the 2-distance(Δ+1)-colorability of plane graphs (in Russian);Borodin;Sib. Electron. Math. Rep.,2004
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Graph r-hued colorings—A survey;Discrete Applied Mathematics;2022-11
2. r-hued (r+1)-coloring of planar graphs with girth at least 8 for r≥9;European Journal of Combinatorics;2021-01
3. Sensitivity of r-hued colouring of graphs;International Journal of Computer Mathematics: Computer Systems Theory;2018-10-02