Linear 2-arboricity of toroidal graphs
From MaRDI portal
Publication:1714033
DOI10.1007/s40840-016-0434-zzbMath1404.05173OpenAlexW2536844146MaRDI QIDQ1714033
Xiaoxue Hu, Yuanchao Li, Yi Qiao Wang, Wei Fan Wang
Publication date: 31 January 2019
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-016-0434-z
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (6)
An improved upper bound on the linear 2-arboricity of 1-planar graphs ⋮ The linear 2-arboricity of IC-planar graphs ⋮ The linear 2-arboricity of sparse graphs ⋮ Light structures in 1-planar graphs with an application to linear 2-arboricity ⋮ On linear 2-arboricity of certain graphs ⋮ The linear 2-arboricity of 1-planar graphs without 3-cycles
Cites Work
- An improved upper bound on the linear 2-arboricity of planar graphs
- On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\)
- On linear k-arboricity
- Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers
- Planar graphs without 5-cycles or without 6-cycles
- Some problems about linear arboricity
- Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
- The linear 2-arboricity of planar graphs
- Linear \(k\)-arboricities on trees
- On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
- On the linear arboricity of graphs embeddable in surfaces
- The linear (n-1)-arboricity of Cartesian product graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Linear 2-arboricity of toroidal graphs