arXiv Analytics

Sign in

arXiv:1203.0757 [math.CO]AbstractReferencesReviewsResources

Spanning trees with small degrees and few leaves

Eduardo Rivera-Campo

Published 2012-03-04Version 1

We give an Ore-type condition sufficient for a graph G to have a spanning tree with small degrees and with few leaves.

Comments: Accepted for publication in Applied Mathematics Letters
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2412.00700 [math.CO] (Published 2024-12-01)
A spectral condition for spanning trees with restricted degrees in bipartite graphs
arXiv:2308.13874 [math.CO] (Published 2023-08-26)
Sufficient conditions for $k$-factors and spanning trees of graphs
arXiv:1108.4647 [math.CO] (Published 2011-08-23)
Expanders Are Universal for the Class of All Spanning Trees

Links

Toolbox