THE LINEAR 6-ARBORICITY OF THE COMPLETE BIPARTITE GRAPH Km,n

DOI10.1142/S1793830913500298zbMath1280.05105MaRDI QIDQ2874040

Shengjie He, Lian-Cui Zuo

Publication date: 28 January 2014

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

complete bipartite graphlinear arboricitybipartite differencelinear 6-arboricity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\)
• The linear 3-arboricity of \(K_{n,n}\) and \(K_n\)
• Some problems about linear arboricity
• On the linear \(k\)-arboricity of cubic graphs
• On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
• The linear arboricity of some regular graphs
• COVERING AND PACKING IN GRAPHS, I.

This page was built for publication: THE LINEAR 6-ARBORICITY OF THE COMPLETE BIPARTITE GRAPH K_m,n