The linear 6-arboricity of the complete bipartite graph K_m,n
From MaRDI portal
Publication:2874040
Recommendations
Cites work
- COVERING AND PACKING IN GRAPHS, I.
- scientific article; zbMATH DE number 1299961 (Why is no real title available?)
- On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\)
- On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
- On the linear k-arboricity of cubic graphs
- Some problems about linear arboricity
- The linear 3-arboricity of \(K_{n,n}\) and \(K_n\)
- The linear arboricity of some regular graphs
Cited in
(9)- On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
- The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\)
- The linear 8-arboricity of the complete bipartite graph \(K_{m,n}\)
- scientific article; zbMATH DE number 734483 (Why is no real title available?)
- The linear t-arboricity of complete bipartite graphs.
- scientific article; zbMATH DE number 7274103 (Why is no real title available?)
- Linear k-arboricity of complete bipartite graphs
- On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\)
- Linear 2-arboricity of the complete graph
This page was built for publication: The linear 6-arboricity of the complete bipartite graph \(K_{m,n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874040)