Packing three copies of a tree into a complete bipartite graph

DOI10.1007/S00026-009-0022-0MaRDI QIDQ659792zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Packing three trees
• Packing Trees into the Complete Graph
• Packing trees in complete graphs
• On packing trees into complete bipartite graphs
• A note on packing of three forests

Cites work

• scientific article; zbMATH DE number 970799 (Why is no real title available?)
• Mutual placement of bipartite graphs
• Packing of graphs - a survey
• Packing of graphs and permutations -- a survey
• Packing trees in complete graphs
• Packing two forests into a bipartite graph

Cited in

(7)

• A note on packing two copies of a tree into a graph with small maximum degree
• Placing two edge-disjoint copies of a tree into a bipartite graph
• Packing two copies of a tree into its third power
• A note on packing of three forests
• Packing three copies of a tree into its sixth power
• Packing four copies of a tree into a complete bipartite graph
• Packing trees in complete bipartite graphs

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

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