Packing four copies of a tree into a complete bipartite graph

DOI10.21136/CMJ.2021.0249-20OpenAlexW4200113046MaRDI QIDQ5071592

Yuan Tang, Liqun Pu, Xiaoli Gao

Publication date: 22 April 2022

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.21136/cmj.2021.0249-20

zbMATH Keywords

embeddingpackingbipartite packing

Mathematics Subject Classification ID

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

Cites Work

• Packing trees in complete graphs
• Mutual placement of bipartite graphs
• Packing two forests into a bipartite graph

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