A bound on the number of leaves in a spanning tree of a connected graph of minimum degree 6

DOI10.1007/s10958-018-4132-2zbMath1414.05172OpenAlexW2904989966WikidataQ128783029 ScholiaQ128783029MaRDI QIDQ2632551

E. N. Simarova

Publication date: 14 May 2019

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-018-4132-2

zbMATH Keywords

dead vertices method

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Connectivity (05C40) Vertex degrees (05C07)

Cites Work

• Spanning trees in graphs of minimum degree 4 or 5
• Transversal numbers of uniform hypergraphs
• Spanning Trees with Many Leaves

This page was built for publication: A bound on the number of leaves in a spanning tree of a connected graph of minimum degree 6