Spanning trees with many leaves

Document Type

Article

Publication Date

1-1-2001

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. © 2001 John Wiley & Sons, Inc.

Publication Source (Journal or Book title)

Journal of Graph Theory

First Page

189

Last Page

197

This document is currently not available here.

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 54
  • Usage
    • Abstract Views: 12
  • Captures
    • Readers: 2
see details

Share

COinS