Packing three trees

DOI10.1016/0012-365X(95)00204-AzbMath0854.05084MaRDI QIDQ1916129

Mariusz Woźniak

Publication date: 13 January 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

treeembeddingpackingcomplete graph

Mathematics Subject Classification ID

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

Related Items

A note on packing of three forests, Packing of graphs and permutations -- a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge disjoint placement of graphs
• Packing trees in complete graphs
• Packing three copies of a tree into a complete graph
• Embedding graphs of small size
• Packing of graphs - a survey
• Triple placement of graphs
• Embedding graphs in their complements
• Every (p,p-2) graph is contained in its complement