Open Access Open Access  Restricted Access Subscription or Fee Access

A note on the linear 2-arboricity of planar graphs without adjacent short cycles

Zongzheng Zhao, Mei Yao, Changqing XU


The linear 2-arboricity of a graph G is the least integer k such that G can be partitioned into k edge disjoint forests, whose component trees are paths of length at most 2. We give an upper bound of linear 2-arboricity of planar graphs without adjacent short cycles, where the short cycle means a cycle of length 3 or 4.


planar graph, linear arboricity, linear 2-arboricity, cycle.

Full Text:



  • There are currently no refbacks.

Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.