Decompositions of graphs into forests with bounded maximum degree

DOI10.1016/0012-365X(91)90377-EzbMath0757.05068MaRDI QIDQ1185098

Miroslaw Truszczynski

Publication date: 28 June 1992

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

zbMATH Keywords

multigraphdegreesarboricityforestsforest decompositionLinear Arboricity ConjectureNash-Williams formula

Mathematics Subject Classification ID

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

Related Items

On \(k\)-planar crossing numbers, Decomposing planar graphs into graphs with degree restrictions, On an \(f\)-coloring generalization of linear arboricity of multigraphs

Cites Work

• Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
• The linear arboricity of some regular graphs
• Some results on linear arboricity
• COVERING AND PACKING IN GRAPHS, I.
• Decomposition of Finite Graphs Into Forests
• Unnamed Item
• Unnamed Item
• Unnamed Item