Journal of Combinatorial Optimization

, Volume 35, Issue 2, pp 365–372 | Cite as

Vertex arboricity of planar graphs without intersecting 5-cycles

  • Hua Cai
  • Jianliang Wu
  • Lin Sun


The vertex arboricity va(G) of a graph G is the minimum number of colors the vertices can be colored so that each color class induces a forest. It was known that \(va(G)\le 3\) for every planar graph G. In this paper, we prove that \(va(G)\le 2\) if G is a planar graph without intersecting 5-cycles.


Vertex arboricity Planar graph Cycle Intersecting Coloring 


  1. Chartrand G, Kronk HV (1969) The point-arboricity of planar graphs. J Lond Math Soc 44:612–616MathSciNetCrossRefMATHGoogle Scholar
  2. Chartrand G, Kronk HV, Wall CE (1968) The point-arboricity of a graph. Israel J Math 6:169–175MathSciNetCrossRefMATHGoogle Scholar
  3. Chen M, Raspaud A, Wang WF (2012) Vertex-arboricity of planar graphs without intersecting triangles. Eur J Combin 33:905–923MathSciNetCrossRefMATHGoogle Scholar
  4. Choi I, Zhang HH (2014) Vertex arboricity of toroidal graphs with a forbidden cycle. Discrete Math 333:101–105MathSciNetCrossRefMATHGoogle Scholar
  5. Fijavž G, Juvan M, Mohar B, Škrekovski R (2002) Planar graphs without cycles of specific lengths. Eur J Combin 23:377–388MathSciNetCrossRefMATHGoogle Scholar
  6. Huang DJ, Wang WF (2013) Vertex arboricity of planar graphs without chordal 6-cycles. Int J Comput Math 90:258–272MathSciNetCrossRefMATHGoogle Scholar
  7. Huang DJ, Shiu WC, Wang WF (2012) On the vertex-arboricity of planar graphs without 7-cycles. Discrete Math 312:2304–2315MathSciNetCrossRefMATHGoogle Scholar
  8. Huang F, Wang XM, Yuan JJ (2014) On the vertex-arboricity of \(K_5\)-minor-free graphs of diameter 2. Discrete Math 322:1–4MathSciNetCrossRefMATHGoogle Scholar
  9. Raspaud A, Wang WF (2008) On the vertex-arboricity of planar graphs. Eur J Combin 29:1064–1075MathSciNetCrossRefMATHGoogle Scholar
  10. Roychoudhury A, Sur-Kolay S (1995) Efficident algorithms for vertex arboricity of planar graph. Foundations of software technology and theoretical computer science, vol 1026. Springer, Berlin, pp 37–51CrossRefMATHGoogle Scholar
  11. Wang WF, Lih K-W (2002) Choosability and edge choosability of planar graphs without five cycles. Appl Math Lett 15:561–565MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.Department of MathematicsChangji UniversityChangjiPeople’s Republic of China
  2. 2.School of MathematicsShandong UniversityJinanPeople’s Republic of China

Personalised recommendations