A note on packing of three forests

DOI10.1016/S0012-365X(96)00060-XzbMath0872.05045OpenAlexW2005191919MaRDI QIDQ1356715

Mariusz Woźniak, Jean-François Saclé

Publication date: 10 June 1997

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00060-x

zbMATH Keywords

packingtreesforests

Mathematics Subject Classification ID

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

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
• Packing of graphs - a survey
• Packing three trees
• Edge-disjoint placement of three trees
• Triple placement of graphs
• Every (p,p-2) graph is contained in its complement