Packing trees with constraints on the leaf degree

DOI10.1007/s00373-008-0804-xzbMath1169.05045OpenAlexW2047525483MaRDI QIDQ1014830

Jácint Szabó

Publication date: 29 April 2009

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

Full work available at URL: https://doi.org/10.1007/s00373-008-0804-x

zbMATH Keywords

graph packingGallai-Edmonds decomposition

Mathematics Subject Classification ID

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

Related Items

Spanning trees: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• An extension of matching theory
• Packing subgraphs in a graph
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Paths, Trees, and Flowers
• The k‐piece packing problem
• A generalization of Kónig's theorem
• The Factors of Graphs
• Spanning trees with constraints on the leaf degree