Packing trees with constraints on the leaf degree

DOI10.1007/S00373-008-0804-XMaRDI QIDQ1014830zbMATH OpenOpenAlexFDO

Authors 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

Gallai-Edmonds decompositiongraph packing

Mathematics Subject Classification ID

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

Recommendations

• Spanning trees with constraints on the leaf degree
• Packing almost stars into the complete graph
• Spanning trees with few leaves
• Packingk-edge trees in graphs of restricted vertex degrees
• On the tree packing conjecture

Cites work

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

Cited in

(5)

• Packing branchings under cardinality constraints on their root sets
• Packingk-edge trees in graphs of restricted vertex degrees
• Maximum tree-packing in time O(n5/2)
• Spanning trees: A survey
• On cyclic packing of a tree

This page was built for publication: Packing trees with constraints on the leaf degree

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