Abstract
If a graph has girth at least seven and half its vertices have degree at least k, then it contains all trees of size k.
Original language | English (US) |
---|---|
Pages (from-to) | 279-283 |
Number of pages | 5 |
Journal | Discrete Mathematics |
Volume | 214 |
Issue number | 1-3 |
DOIs | |
State | Published - Mar 21 2000 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics