The linear arboricity of planar graphs with no short cycles
From MaRDI portal
Publication:995578
DOI10.1016/j.tcs.2007.05.003zbMath1206.05035OpenAlexW1974658009WikidataQ126263464 ScholiaQ126263464MaRDI QIDQ995578
Jian-Feng Hou, Jian Liang Wu, Gui Zhen Liu
Publication date: 3 September 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.05.003
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
A Planar linear arboricity conjecture ⋮ The linear arboricity of planar graphs without 5-, 6-cycles with chords ⋮ Minimum number of disjoint linear forests covering a planar graph ⋮ Unnamed Item ⋮ The linear arboricity of planar graphs with maximum degree at least 5 ⋮ Unnamed Item
Cites Work
- 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
- Complexité de l'arboricité linéaire d'un graphe
- COVERING AND PACKING IN GRAPHS, I.
- Linear arboricity and linear \(k\)-arboricity of regular graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item