Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles

DOI10.1007/s00373-011-1122-2zbMath1267.05122OpenAlexW2057488828MaRDI QIDQ2376098

Hong-Xia Niu, Jian-Sheng Cai

Publication date: 26 June 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1122-2

zbMATH Keywords

cycleplanar graphlinear 2-arboricity cycle

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

On the linear 2-arboricity of planar graph without normally adjacent 3-cycles and 4-cycles ⋮ On linear 2-arboricity of certain graphs

Cites Work

• On linear k-arboricity
• Planar graphs without 5-cycles or without 6-cycles
• Some problems about linear arboricity
• Algorithmic aspects of linear \(k\)-arboricity
• Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
• On the linear \(k\)-arboricity of cubic graphs
• The linear 2-arboricity of planar graphs
• Linear \(k\)-arboricities on trees
• The linear arboricity of series-parallel graphs
• The linear arboricity of some regular graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles