# Spanning Trees: A Survey

@article{Ozeki2011SpanningTA,
title={Spanning Trees: A Survey},
author={Kenta Ozeki and Tomoki Yamashita},
journal={Graphs and Combinatorics},
year={2011},
volume={27},
pages={1-26}
}
• Published 2011
• Mathematics
• Graphs and Combinatorics
In this paper, we give a survey of spanning trees. We mainly deal with spanning trees having some particular properties concerning a hamiltonian properties, for example, spanning trees with bounded degree, with bounded number of leaves, or with bounded number of branch vertices. Moreover, we also study spanning trees with some other properties, motivated from optimization aspects or application for some problems.
Spanning trees with bounded degrees and leaves
• Mathematics, Computer Science
Discret. Math.
• 2016
Spanning trees with few branch vertices
• Mathematics
SIAM J. Discret. Math.
• 2019
It is proved that, for all $s\geq 1$, every connected graph on n vertices with minimum degree at least $(\frac{1}{s+3}+o(1))n contains a spanning tree having at most s branch vertices. Lower bounds for the spanning tree numbers of two graph products • Mathematics • 2013 For any graph$G$of order$n$, the spanning tree packing number \emph{$STP(G)$}, is the maximum number of edge-disjoint spanning trees contained in$G\$. In this paper, we obtain some sharp lower
Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below
• Mathematics, Computer Science
• 2015
Probabilistic analysis is carried out of an approximation algorithm with quadratic time complexity for an exponential distribution with sufficient conditions for the asymptotic optimality of the algorithmare justified.
Counting the spanning trees of the 3-cube using edge slides
We give a direct combinatorial proof of the known fact that the 3-cube has 384 spanning trees, using an "edge slide" operation on spanning trees. This gives an answer in the case n=3 to a question
On Spanning Trees with few Branch Vertices , all with degree 3
• Mathematics
• 2016
Let G be a connected claw-free graph. A conjecture of Matsuda, Ozeki, and Yamashita  posits the existence of either a spanning tree with few branch vertices or a large independent set of small
On spanning trees with few branch vertices
• Mathematics
Discret. Math.
• 2020
Spanning k-ended trees of 3-regular connected graphs
• Mathematics, Computer Science
Electron. J. Graph Theory Appl.
• 2017
This paper proves that every 3-regular connected graph with n vertices such that n is greater than 8 has spanning sub tree with at most [(2n+4)/9]-ended tree, and gives a conjecture about spanning k-ended trees on 3- regular connected graphs.
New Formulations for the Minimum Branch Vertices Problem
This work introduces novel Mixed Integer Linear Programming (MILP) formulations for the MBV by improving the formulations from the literature, and performs extensive computational experiments on standard test sets, to analyze their performance.