A note on the linear 2-arboricity of planar graphs
DOI10.1016/J.DISC.2017.01.027zbMATH Open1365.05065OpenAlexW2602882405MaRDI QIDQ526220FDOQ526220
Authors: Xiaoxue Hu, Yiqiao Wang, Weifan Wang 
Publication date: 10 May 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.01.027
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- On the total coloring of planar graphs.
- Some problems about linear arboricity
- On the linear \(k\)-arboricity of cubic graphs
- The linear 2-arboricity of planar graphs
- Linear \(k\)-arboricities on trees
- Title not available (Why is that?)
- An improved upper bound on the linear 2-arboricity of planar graphs
- On linear k-arboricity
Cited In (9)
- On linear 2-arboricity of certain graphs
- An improved upper bound on the linear 2-arboricity of 1-planar graphs
- Edge-partition and star chromatic index
- The linear 2-arboricity of IC-planar graphs
- An improved upper bound on the linear 2-arboricity of toroidal graphs
- Linear 2-arboricity of planar graphs with maximum degree nine
- Light structures in 1-planar graphs with an application to linear 2-arboricity
- The linear 2-arboricity of 1-planar graphs without 3-cycles
- On the linear vertex-arboricity of a planar graph
This page was built for publication: A note on the linear 2-arboricity of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526220)
