Packing three copies of a tree into a complete bipartite graph

DOI10.1007/S00026-009-0022-0zbMath1229.05233OpenAlexW2007468761MaRDI QIDQ659792

Hong Wang

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-009-0022-0

zbMATH Keywords

embeddingpackingbipartite packing

Mathematics Subject Classification ID

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

Related Items (2)

Placing two edge-disjoint copies of a tree into a bipartite graph ⋮ Packing trees in complete bipartite graphs

Cites Work

• Packing trees in complete graphs
• Mutual placement of bipartite graphs
• Packing of graphs and permutations -- a survey
• Packing of graphs - a survey
• Packing two forests into a bipartite graph
• Unnamed Item

This page was built for publication: Packing three copies of a tree into a complete bipartite graph