We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Linear 2-Arboricity of Planar Graphs with Neither 3-Cycles Nor Adjacent 4-Cycles.
- Authors
Niu, Hong-Xia; Cai, Jian-Sheng
- Abstract
Let G be a planar graph with neither 3-cycles nor adjacent 4-cycles. We prove that if G is connected and δ( G) ≥ 2, then G contains an edge uv with d( u) + d( v) ≤ 7 or a 2-alternating cycle. By this result, we obtain that G's linear 2-arboricity $${la_{2}(G)\leq\lceil\frac{\Delta(G)+1}{2}\rceil+4.}$$.
- Subjects
LINEAR systems; PLANAR graphs; PATHS &; cycles in graph theory; MATHEMATICAL proofs; GRAPH connectivity; SET theory; SUBGRAPHS
- Publication
Graphs & Combinatorics, 2013, Vol 29, Issue 3, p661
- ISSN
0911-0119
- Publication type
Article
- DOI
10.1007/s00373-011-1122-2