References
- Borodin , O. V. and Ivanova , A. O. 2009 . Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable . J. Graph Theory , 62 : 234 – 240 . (doi:10.1002/jgt.20394)
- Borodin , O. V. , Kostochka , A. V. and Toft , B. 2000 . Variable degeneracy: Extensions of Brooks’ and Gallai's theorems . Discrete Math. , 214 : 101 – 112 . (doi:10.1016/S0012-365X(99)00221-6)
- Burr , S. A. 1986 . An inequality involving the vertex arboricity and edge arboricity of a graph . J. Graph Theory , 10 : 403 – 404 . (doi:10.1002/jgt.3190100315)
- Catlin , P. A. and Lai , H. 1995 . Vertex arboricity and maximum degree . Discrete Math. , 141 : 37 – 46 . (doi:10.1016/0012-365X(93)E0205-I)
- Chang , G. J. , Chen , C. and Chen , Y. 2004 . Vertex and tree arboricities of graphs . J. Comb. Optim. , 8 : 295 – 306 . (doi:10.1023/B:JOCO.0000038912.82046.17)
- Chartrand , G. and Kronk , H. V. 1969 . The point-arboricity of planar graphs . J. London Math. Soc. , 44 : 612 – 616 . (doi:10.1112/jlms/s1-44.1.612)
- Chartrand , G. , Kronk , H. V. and Wall , C. E. 1968 . The point-arboricity of a graph . Israel J. Math. , 6 : 169 – 175 . (doi:10.1007/BF02760181)
- Chen , Z. 1995 . “ NC algorithms for partitioning sparse graphs into induced forests with an application ” . In Proc. 6th Internat. Symp. on Algorithms and Computations , Edited by: Staples , J. , Eades , P. , Katoh , N. and Moffat , A. Vol. 1004 , 428 – 437 . Berlin : Springer . Lecture Notes in Computer Science
- Chen , Z. 2000 . Efficient algorithms for acyclic colourings of graphs . Theor. Comput. Sci. , 230 : 75 – 95 . (doi:10.1016/S0304-3975(97)00254-5)
- Chen , Z. and He , X. 1996 . Parallel complexity of partitioning a planar graph into vertex-induced forests . Discrete Appl. Math. , 69 : 183 – 198 . (doi:10.1016/0166-218X(96)00089-3)
- Chen , M. , Raspaud , A. and Wang , W. 2012 . Vertex-arboricity of planar graphs without intersecting triangles . Eur. J. Combin. , 33 : 905 – 923 . (doi:10.1016/j.ejc.2011.09.017)
- Fijavz˘ , G. , Juvan , M. , Mohar , B. and [Sbreve]krekovski , R. 2002 . Planar graphs without cycles of specific lengths . Eur. J. Combin. , 23 : 377 – 388 . (doi:10.1006/eujc.2002.0570)
- Garey , M. R. and Johnson , D. S. 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness , New York : W.H. Freeman and Company .
- Hakimi , S. L. and Schmeichel , E. F. 1989 . A note on the vertex arboricity of a graph . SIAM J. Discrete Math. , 2 : 64 – 67 . (doi:10.1137/0402007)
- Huang , D. , Shiu , W. C. and Wang , W. 2012 . On the vertex-arboricity of planar graphs without 7-cycles . Discrete Math. , 312 : 2304 – 2315 . (doi:10.1016/j.disc.2012.03.035)
- Kronk , H. V. and Mitchem , J. 1974/1975 . Critical point-arboritic graphs . J. London Math. Soc. , 9 : 459 – 466 . (doi:10.1112/jlms/s2-9.3.459)
- Raspaud , A. and Wang , W. 2008 . On the vertex-arboricity of planar graphs . Eur. J. Combin. , 29 : 1064 – 1075 . (doi:10.1016/j.ejc.2007.11.022)
- Roychoudhury , A. and Sur-Kolay , S. 1995 . “ Efficient algorithms for vertex arboricity of planar graphs ” . In Proc. 15th Internat. Conf. on Foundations of Software Technology and Theoretical Computer Science , Edited by: Thiagarajan , P. S. Vol. 1026 , 37 – 51 . Berlin : Springer . Lecture Notes in Computer Science
- Stein , S. K. 1971 . B-set and planar maps . Pacific J. Math. , 37 : 217 – 224 . (doi:10.2140/pjm.1971.37.217)
- Wang , W. and Lih , K.-W. 2002 . Choosability and edge choosability of planar graphs without five cycles . Appl. Math. Lett. , 15 : 561 – 565 . (doi:10.1016/S0893-9659(02)80007-6)