Abstract
Let {T2, ... , Tt} be a sequence of trees, where Ti has i vertices. We show that if t < 0.79n, then the sequence can be packed into the complete bipartite graph Kn-1,n/2(Kn,(n-1)/2), where n is even (odd). This significantly improves the result which appears in [2].
Original language | English |
---|---|
Pages (from-to) | 325-327 |
Number of pages | 3 |
Journal | Discrete Mathematics |
Volume | 163 |
Issue number | 1-3 |
DOIs | |
State | Published - 15 Jan 1997 |
Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics