The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\)

DOI10.1155/2013/501701zbMath1295.05132OpenAlexW2006056212WikidataQ58923545 ScholiaQ58923545MaRDI QIDQ2248715

Bing Xue, Shengjie He, Lian-Cui Zuo

Publication date: 27 June 2014

Published in: International Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/501701

zbMATH Keywords

linear \(G\)-forest

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12)

Cites Work

• On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\)
• On linear k-arboricity
• Relaxed two-coloring of cubic graphs
• The linear 3-arboricity of \(K_{n,n}\) and \(K_n\)
• 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
• 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}\)
• E ₁₁ and M theory
• La k-Arboricité Linéaire Des Arbres
• On the linearK-arboricity of cubic graphs
• COVERING AND PACKING IN GRAPHS, I.
• On isomorphic linear partitions in cubic graphs
• Linear arboricity and linear \(k\)-arboricity of regular graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\)