Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4650668 | Discrete Mathematics | 2008 | 8 Pages |
Abstract
We generalize a known sufficient condition for the traceability of a graph to a condition for the existence of a spanning tree with a bounded number of leaves. Both of the conditions involve neighborhood unions. Further, we present two results on spanning spiders (trees with a single branching vertex). We pose a number of open questions concerning extremal spanning trees.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Evelyne Flandrin, Tomáš Kaiser, Roman Kužel, Hao Li, Zdeněk Ryjáček,