Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference12 articles.
1. M.O. Albertson and D.M. Berman, Every planar graph has an acyclic 7-coloring, Israel J. Math. 28 (1977) 169–174.
2. O.V. Borodin, On decomposition of graphs into degenerated subgraphs, Discretny analys, Novosibirsk 28 (1976) 3–12 (in Russian).
3. G. Chartrand and H.V. Kronk, The point arboricity of planar graphs, J. London Math. Soc. 44 (1968) 612–616.
4. G. Chartrand, D.P. Geller and S. Hedetniemi, Graphs with forbidden subgraphs, J. Combin. Theory 10 (1971) 12–41.
5. B. Grünbaum, Acyclic colorings of planar graphs, Israel J. Math. 14 (1973) 390–412.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献