Abstract
We show that if G is a simple connected graph with |E(G)|≥|V(G)|+1/2t(t-1) and |V(G)|≠t+2, then G has a spanning tree with >t leaves, and this is best possible.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 189-197 |
| Number of pages | 9 |
| Journal | Journal of Graph Theory |
| Volume | 37 |
| Issue number | 4 |
| DOIs | |
| State | Published - Aug 2001 |
All Science Journal Classification (ASJC) codes
- Geometry and Topology
Keywords
- Leaves
- Tree