The number of bounded‐degree spanning trees

DOI10.1002/rsa.21118zbMath1522.05042arXiv2207.14574MaRDI QIDQ6074882

Raphael Yuster

Publication date: 19 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.14574

zbMATH Keywords

countingspanning treebounded degree

Mathematics Subject Classification ID

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

Cites Work

• Counting and packing Hamilton cycles in dense graphs and oriented graphs
• Hamiltonian cycles in Dirac graphs
• Spanning trees in regular graphs
• A bound for the complexity of a simple graph
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• On the number of Hamiltonian cycles in Dirac graphs
• The average number of spanning trees in sparse graphs with given degrees
• Hamiltonicity in connected regular graphs
• The number of spanning trees in regular graphs
• The number of spanning trees in graphs with a given degree sequence
• Some Theorems on Abstract Graphs
• Spanning trees of bounded degree

This page was built for publication: The number of bounded‐degree spanning trees