Linear 3-arboricity of the balanced complete multipartite graphs

MaRDI QIDQ5755102zbMATH OpenFDO

Authors Chih-Hung Yen, Hung-Lin Fu

Publication date 20 August 2007

zbMATH Keywords

Balanced complete multipartite graphLinear \(k\)-arboricityLinear \(k\)-forest

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The linear 3-arboricity of \(K_{n,n}\) and \(K_n\)
• On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\)
• The linear 8-arboricity of the complete bipartite graph \(K_{m,n}\)
• The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\)
• Linear 2-arboricity of the complete graph

Cited in

(8)

• Factorisation of regular graphs into forests of short paths
• Linear k-arboricity of Caylay graphs on abelian groups with given degree
• The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\)
• The linear \((n - 1)\)-arboricity of some lexicographic product graphs
• scientific article; zbMATH DE number 4057555 (Why is no real title available?)
• Optimal wirelength of balanced complete multipartite graphs onto Cartesian product of \{path, cycle\} and trees
• On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\)
• The linear 3-arboricity of \(K_{n,n}\) and \(K_n\)

This page was built for publication: Linear 3-arboricity of the balanced complete multipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5755102)