On packing trees into complete bipartite graphs
From MaRDI portal
Publication:1356567
DOI10.1016/S0012-365X(96)00014-3zbMath0871.05013OpenAlexW1980149616MaRDI QIDQ1356567
Publication date: 24 September 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00014-3
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (4)
An approximate version of the tree packing conjecture ⋮ Packing a number of copies of a \(( p , q )\)-graph ⋮ A note on the ``packing of two copies of some trees into their third power ⋮ Packing three copies of a tree into its sixth power
Cites Work
This page was built for publication: On packing trees into complete bipartite graphs
