Packing trees of bounded diameter into the complete graph

MaRDI QIDQ5294918zbMATH OpenFDO

Authors Edward Dobson

Publication date 26 July 2007

zbMATH Keywords

Ringel conjecturetree packing conjecture

Mathematics Subject Classification ID

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

Recommendations

• Packing almost stars into the complete graph
• scientific article; zbMATH DE number 22649
• On the tree packing conjecture
• Packing Trees into the Complete Graph
• Packing trees in complete graphs

Cited in

(12)

• Packing trees of unbounded degrees in random graphs
• Packing spanning graphs from separable families
• Packing large trees of consecutive orders
• Packingk-edge trees in graphs of restricted vertex degrees
• Packing trees in complete graphs
• An approximate version of the tree packing conjecture via random embeddings
• Optimal packings of bounded degree trees
• A special case of the tree packing conjecture
• Distinct Sums Modulo n and Tree Embeddings
• Packing Trees into the Complete Graph
• Packing large balanced trees into bipartite graphs
• A survey on the existence ofG-Designs

This page was built for publication: Packing trees of bounded diameter into the complete graph

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