A note on packing trees into complete bipartite graphs and on Fishburn's conjecture

DOI10.1016/0012-365X(90)90209-ZzbMath0702.05027OpenAlexW2054791216WikidataQ123150044 ScholiaQ123150044MaRDI QIDQ914692

Yehuda Roditty, Yair Caro

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90209-z

Mathematics Subject Classification ID

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

Related Items (5)

An approximate version of the tree packing conjecture ⋮ On packing trees into complete bipartite graphs ⋮ Packing a number of copies of a \(( p , q )\)-graph ⋮ Packings and coverings of \(\lambda K_{v}\) by \(k\)-circuits with one chord. ⋮ Packing three copies of a tree into its sixth power

Cites Work

• Packing trees in complete graphs
• Some remarks on packing trees
• Packing graphs with odd and even trees
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on packing trees into complete bipartite graphs and on Fishburn's conjecture