On the linear (n - 1)-arboricity of K_n(m)

DOI10.1016/J.DAM.2010.04.013MaRDI QIDQ608262zbMATH OpenOpenAlexFDO

Authors Bing Xue, Liancui Zuo

Publication date 25 November 2010

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2010.04.013

zbMATH Keywords

linear arboricitybalanced complete \(n\)-partite graphlinear \(k\)-arboricitylinear \(k\)-forest

Mathematics Subject Classification ID

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

Recommendations

• The linear 6-arboricity of the complete bipartite graph \(K_{m,n}\)
• The linear 8-arboricity of the complete bipartite graph \(K_{m,n}\)
• The linear 3-arboricity of \(K_{n,n}\) and \(K_n\)
• 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}\)

Cites work

• scientific article; zbMATH DE number 91047 (Why is no real title available?)
• scientific article; zbMATH DE number 3637904 (Why is no real title available?)
• scientific article; zbMATH DE number 1229605 (Why is no real title available?)
• scientific article; zbMATH DE number 734483 (Why is no real title available?)
• Algorithmic aspects of linear k-arboricity
• COVERING AND PACKING IN GRAPHS, I.
• La k-Arboricité Linéaire Des Arbres
• Linear 2-arboricity of the complete graph
• Linear 3-arboricity of the balanced complete multipartite graphs
• Linear \(k\)-arboricities on trees
• Linear arboricity and linear k-arboricity of regular graphs
• On isomorphic linear partitions in cubic graphs
• On linear k-arboricity
• On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
• On the linear k-arboricity of cubic graphs
• On the linearK-arboricity of cubic graphs
• Relaxed two-coloring of cubic graphs
• Some problems about linear arboricity
• The linear 2-arboricity of planar graphs
• The linear 3-arboricity of \(K_{n,n}\) and \(K_n\)
• Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5

Cited in

(15)

• Linear \(k\)-arboricities on trees
• The linear arboricity of the Schrijver graph \(SG(2k+2,k)\)
• scientific article; zbMATH DE number 4057555 (Why is no real title available?)
• The linear \((n - 1)\)-arboricity of some lexicographic product graphs
• Linear arboricity and linear k-arboricity of regular graphs
• Linear 2-arboricity of toroidal graphs
• The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\)
• The linear 3-arboricity of \(K_{n,n}\) and \(K_n\)
• The linear 8-arboricity of the complete bipartite graph \(K_{m,n}\)
• The hamiltonicity and path t-coloring of Sierpiński-like graphs
• On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
• Linear 3-arboricity of the balanced complete multipartite graphs
• The linear \((n-1)\)-arboricity of Cartesian product graphs
• Constructing disjoint Steiner trees in Sierpiński graphs
• The linear 6-arboricity of the complete bipartite graph \(K_{m,n}\)

This page was built for publication: On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\)

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