Spanning trees with small degrees and few leaves
classification
🧮 math.CO
keywords
degreesleavessmallspanningconditiongivegraphore-type
read the original abstract
We give an Ore-type condition sufficient for a graph G to have a spanning tree with small degrees and with few leaves.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.