An improved upper bound on the linear 2-arboricity of planar graphs
详细信息 查看全文
- 作者：Yiqiao Wang yqwang@bucm.edu.cn" class="auth_mail" title="E-mail the corresponding author
- 关键词：Planar graph ; Linear 2-arboricity ; Maximum degree
- 刊名：Discrete Mathematics
- 出版年：2016
- 出版时间：6 January 2016
- 年：2016
- 卷：339
- 期：1
- 页码：39-45
- 全文大小：384 K
文摘
The linear 2-arboricity 
of a graph G is the least integer 3689b2a18dc5d" title="Click to view the MathML source">k such that G can be partitioned into 3689b2a18dc5d" title="Click to view the MathML source">k edge-disjoint forests, whose component trees are paths of length at most 2. In this paper, we prove that if G is a planar graph, then . This improves a result in Lih et al. (2003), which says that every planar graph G satisfies .
of a graph G is the least integer 3689b2a18dc5d" title="Click to view the MathML source">k such that G can be partitioned into 3689b2a18dc5d" title="Click to view the MathML source">k edge-disjoint forests, whose component trees are paths of length at most 2. In this paper, we prove that if G is a planar graph, then . This improves a result in Lih et al. (2003), which says that every planar graph G satisfies .