Author:
Wang Juan,Miao Lianying,Song Wenyao,Liu Yunlong
Funder
National Natural Science Foundation of China
Natural Science Foundation of Shandong Province
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference26 articles.
1. Alon, N., Mcdiarmid, C., Reed, B.: Acyclic coloring of graphs. Random Struct. Algor. 2, 277–288 (1991)
2. Burstein, M.I.: Every 4-valent graph has an acyclic 5-coloring (in Russian). Soobšč. Akad. Nauk Gruzin SSR 93, 21–24 (1979)
3. Bollobás, B.: Modern Graph Theory. Springer, New York, Inc (1998)
4. Borodin, O.V.: On acyclic colorings of planar graphs. Discrete Math. 25, 211–236 (1979)
5. Coleman, T.F., Cai, J.Y.: The cyclic coloring problem and estimation of sparse Hessian matrices. SIAM J. Algebr. Discrete Methods 7, 221–235 (1986)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献