On the linear arboricity of graphs embeddable in surfaces
DOI10.1016/J.IPL.2014.03.013zbMATH Open1294.05129OpenAlexW2126280327MaRDI QIDQ2448856FDOQ2448856
Authors: Bin Liu, Huijuan Wang, Jian-Liang Wu, Hongyu Chen Edit this on Wikidata
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
Recommendations
Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory with applications
- The linear arboricity of series-parallel graphs
- The linear arboricity of planar graphs of maximum degree seven is four
- The linear arboricity of some regular graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Covering and packing in graphs IV: Linear arboricity
- Title not available (Why is that?)
- The linear arboricity of composition graphs
Cited In (12)
- A decomposition method on solving the linear arboricity conjecture
- Title not available (Why is that?)
- Linear arboricity of 1-planar graphs
- Linear arboricity of an embedded graph on a surface of large genus
- Linear 2-arboricity of toroidal graphs
- Linear arboricity of IC-planar graphs
- Title not available (Why is that?)
- Linear arboricity of degenerate graphs
- Title not available (Why is that?)
- The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic
- The linear arboricity of \(K_5\)-minor free graphs
- An efficient case for computing minimum linear arboricity with small maximum degree
This page was built for publication: On the linear arboricity of graphs embeddable in surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448856)
