Spanning trees with small degrees and few leaves

Published 4 Mar 2012 in math.CO | (1203.0757v1)

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

Authors (1)

No one has generated a summary of this paper yet.

No one has generated a video about this paper yet.

No one has generated a whiteboard explanation for this paper yet.

We haven't generated a list of open problems mentioned in this paper yet.

We haven't generated follow-up questions for this paper yet.