Subject
Applied Mathematics,Computational Mathematics
Reference24 articles.
1. Every planar graph has an acyclic 7-coloring;Albertson;Israel J. Math.,1977
2. Acyclic coloring of graphs;Alon;Random Struct. Algorithms,1991
3. Graph Theory, GTM, 244;Bondy,2008
4. On acyclic colorings of planar graphs;Borodin;Discrete Math.,2006
5. The cyclic coloring problem and estimation of sparse hessian matrices;Coleman;SIAM J. Algebra Discrete Methods,1986
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Note on the perfect Roman domination number of graphs;Applied Mathematics and Computation;2020-01
2. On the double Roman domination of graphs;Applied Mathematics and Computation;2018-12