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

DOI10.1016/J.DAM.2010.04.013zbMATH Open1215.05138OpenAlexW2001640447MaRDI QIDQ608262FDOQ608262

Liancui Zuo, Bing Xue

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

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}\)

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)

Cites Work

• Title not available (Why is that?)
• COVERING AND PACKING IN GRAPHS, I.
• Linear arboricity and linear \(k\)-arboricity of regular graphs
• On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On linear k-arboricity
• La k-Arboricité Linéaire Des Arbres
• On the linearK-arboricity of cubic graphs
• Linear 3-arboricity of the balanced complete multipartite graphs
• On isomorphic linear partitions in cubic graphs
• Relaxed two-coloring of cubic graphs
• The linear 3-arboricity of \(K_{n,n}\) and \(K_n\)
• Linear 2-arboricity of the complete graph

Cited In (11)

• Linear \(k\)-arboricities on trees
• Title not available (Why is that?)
• Linear arboricity and linear \(k\)-arboricity of regular graphs
• The linear \((n - 1)\)-arboricity of some lexicographic product 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 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 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)