A note on the arboricity of graphs

DOI10.1007/BF02351587zbMath0767.05074OpenAlexW1988582774MaRDI QIDQ1205341

Martin Kochol

Publication date: 1 April 1993

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02351587

zbMATH Keywords

decompositionregular graphscoverarboricityforeststheorem of Nash-Williams

Mathematics Subject Classification ID

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

Cites Work

• The linear arboricity of graphs
• The linear arboricity of some regular graphs
• Covering and packing in graphs IV: Linear arboricity
• Minimum partition of a matroid into independent subsets
• Decomposition of Finite Graphs Into Forests
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the arboricity of graphs