The linear 3-arboricity of \(K_{n,n}\) and \(K_n\)
From MaRDI portal
Publication:932632
DOI10.1016/j.disc.2007.07.067zbMath1160.05015OpenAlexW2093043367MaRDI QIDQ932632
Kuo-Ching Huang, Chih-Hung Yen, Hung-Lin Fu
Publication date: 11 July 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.067
Related Items
On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\) ⋮ The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\) ⋮ Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree ⋮ The linear \((n - 1)\)-arboricity of some lexicographic product graphs ⋮ THE LINEAR 6-ARBORICITY OF THE COMPLETE BIPARTITE GRAPH Km,n
Cites Work
- On linear k-arboricity
- Linear 2-arboricity of the complete graph
- Some problems about linear arboricity
- Algorithmic aspects of linear \(k\)-arboricity
- Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
- Parallel concepts in graph theory
- On the linear \(k\)-arboricity of cubic graphs
- The linear 2-arboricity of planar graphs
- Linear \(k\)-arboricities on trees
- On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
- La k-Arboricité Linéaire Des Arbres
- Linear arboricity and linear \(k\)-arboricity of regular graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item