Linear 2-arboricity of the complete graph
From MaRDI portal
Publication:971523
DOI10.11650/twjm/1500405741zbMath1188.05081OpenAlexW1485867460MaRDI QIDQ971523
Publication date: 14 May 2010
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11650/twjm/1500405741
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (4)
On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\) ⋮ The linear 3-arboricity of \(K_{n,n}\) and \(K_n\) ⋮ The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\) ⋮ The linear \((n - 1)\)-arboricity of some lexicographic product graphs
This page was built for publication: Linear 2-arboricity of the complete graph