An extension of Nash-Williams and Tutte's theorem

DOI10.1002/JGT.23189MaRDI QIDQ6657600

Daqing Yang, Xuqian Fang

Publication date: 6 January 2025

Published in: Journal of Graph Theory (Search for Journal in Brave)

zbMATH Keywords

fractional packing numbertree-packingNash-Williams and Tutte's theoremNine Dragon Tree theorem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)
• Decomposing a graph into forests: the nine dragon tree conjecture is true
• Decomposing a graph into forests
• Extensions of matroid covering and packing
• Decomposing a graph into forests and a matching
• Decomposition of sparse graphs into forests and a graph with bounded degree
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Transversals and matroid partition
• Decomposition of Finite Graphs Into Forests
• The strong nine dragon tree conjecture is true for \(d \le k + 1\)

This page was built for publication: An extension of Nash-Williams and Tutte's theorem

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