NASH‐WILLIAMS’ THEOREM ON DECOMPOSING GRAPHS INTO FORESTS

DOI10.1112/S0025579313000119zbMath1298.05269arXiv1705.01648WikidataQ60620234 ScholiaQ60620234MaRDI QIDQ3191152

Lisa Sauermann, Christian Reiher

Publication date: 24 September 2014

Published in: Mathematika (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.01648

zbMATH Keywords

covering of graphs

Mathematics Subject Classification ID

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

Related Items (2)

Extensions of matroid covering and packing ⋮ An enhancement of Nash-Williams' theorem on edge arboricity of graphs

Cites Work

• A short proof of Nash-Williams' theorem for the arboricity of a graph
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Decomposition of Finite Graphs Into Forests

This page was built for publication: NASH‐WILLIAMS’ THEOREM ON DECOMPOSING GRAPHS INTO FORESTS