On the linear arboricity of graphs embeddable in surfaces

DOI10.1016/j.ipl.2014.03.013zbMath1294.05129OpenAlexW2126280327MaRDI QIDQ2448856

Bin Liu, Jian Liang Wu, Hui-Juan Wang, Hong-Yu Chen

Publication date: 5 May 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.03.013

zbMATH Keywords

Euler characteristiccombinatorial problemslinear arboricityembedded graph

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

An efficient case for computing minimum linear arboricity with small maximum degree ⋮ Linear 2-arboricity of toroidal graphs ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The linear arboricity of series-parallel graphs
• The linear arboricity of composition graphs
• A Planar linear arboricity conjecture
• 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