The linear arboricity of planar graphs without 5-, 6-cycles with chords
From MaRDI portal
Publication:2376109
DOI10.1007/s00373-011-1118-yzbMath1267.05146OpenAlexW2047115068MaRDI QIDQ2376109
Xiang Tan, Hong-Yu Chen, Guo Jun Li, Jian Liang Wu
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-1118-y
Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (3)
The linear arboricity of planar graphs with maximum degree at least 5 ⋮ Neighbor sum distinguishing edge colorings of graphs with small maximum average degree ⋮ The linear arboricity of \(K_5\)-minor free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The linear arboricity of planar graphs with no short cycles
- The linear arboricity of series-parallel graphs
- The linear arboricity of composition graphs
- The linear arboricity of planar graphs of maximum degree seven is four
- The linear arboricity of some regular graphs
- Covering and packing in graphs IV: Linear arboricity
- COVERING AND PACKING IN GRAPHS, I.
This page was built for publication: The linear arboricity of planar graphs without 5-, 6-cycles with chords