Spanning trees with small degrees and few leaves
Combinatorics
2015-11-05 v1
Abstract
We give an Ore-type condition sufficient for a graph G to have a spanning tree with small degrees and with few leaves.
Keywords
Cite
@article{arxiv.1203.0757,
title = {Spanning trees with small degrees and few leaves},
author = {Eduardo Rivera-Campo},
journal= {arXiv preprint arXiv:1203.0757},
year = {2015}
}
Comments
Accepted for publication in Applied Mathematics Letters