Packing and decomposition of graphs with trees

DOI10.1006/jctb.1999.1934zbMath1028.05095OpenAlexW1994941667MaRDI QIDQ1569062

Raphael Yuster

Publication date: 25 June 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1010d8b7b6ae8ab30af1efba289c9588f47f1a28

Mathematics Subject Classification ID

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

Related Items (8)

Minimum degree and minimum number of edge-disjoint trees ⋮ Decomposing almost complete graphs by random trees ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ Decomposing almost complete graphs by random trees ⋮ Almost Every Tree With m Edges Decomposes K_2m,2m ⋮ Clumsy packings of graphs ⋮ Unnamed Item ⋮ Optimal packings of bounded degree trees

Cites Work

• Covering graphs: The covering problem solved
• Packing graphs: The packing problem solved
• Some remarks on packing trees
• A bound for Wilson's theorem (III)
• Tree decomposition of graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Packing and decomposition of graphs with trees