Packing trees in complete bipartite graphs

DOI10.7151/DMGT.2252zbMath1479.05306OpenAlexW2987204348MaRDI QIDQ2062685

Jieyan Wang

Publication date: 3 January 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2252

zbMATH Keywords

bipartite graphpackingplacementedge-disjoint tree

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Packing three copies of a tree into a complete bipartite graph
• Packing three copies of a tree into a complete graph
• Embedding (p,p - 1) graphs in their complements
• Packing of graphs and permutations -- a survey
• Packing of graphs - a survey
• 2-placement of (p,q)-trees
• Packing two forests into a bipartite graph

This page was built for publication: Packing trees in complete bipartite graphs