Spanning Trees: A Survey

  title={Spanning Trees: A Survey},
  author={Kenta Ozeki and Tomoki Yamashita},
  journal={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
Note on the spanning-tree packing number of lexicographic product graphs
Spanning trees with few branch vertices
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
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
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
Let G be a connected claw-free graph. A conjecture of Matsuda, Ozeki, and Yamashita [9] posits the existence of either a spanning tree with few branch vertices or a large independent set of small
Spanning k-ended trees of 3-regular connected graphs
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.


Spanning Trees with Few Leaves
In this paper, we prove that an m-connected graph G on n vertices has a spanning tree with at most k leaves (for k ≥ 2 and m ≥ 1) if every independent set of G with cardinality m + k contains at
Spanning Trees with Bounded Number of Branch Vertices
We introduce the following combinatorial optimization problem: Given a connected graph G, find a spanning tree T of G with the smallest number of branchv ertices (vertices of degree 3 or more in T).
On the spanning tree packing number of a graph: a survey
The number of spanning trees in circulant graphs
Interpolation theorem for diameters of spanning trees
We give an algorithmic approach for transforming any spanning tree of a 2-connected graph into any other spanning tree of the graph. At each step of the transformation we obtain a spanning tree whose
Approximating Maximum Leaf Spanning Trees in Almost Linear Time
This paper gives a new greedy 3-approximation algorithm for maximum leaf spanning trees, where the running timeO((m+n)?(m,n)) required by the algorithm, where m is the number of edges and n is thenumber of nodes, is almost linear in the size of the graph.
Degree-preserving spanning trees in small-degree graphs
Independent Trees in Planar Graphs Independent trees
It is proved that for each vertex x≠s of G, the k paths from x to s in T1,…,Tk are pairwise openly disjoint.
On a Spanning Tree with Specified Leaves
It is shown that if G is a (k + 1)-connected graph and each pair of nonadjacent vertices in G has degree sum at least |G| +-1, then for each subset S of V(G) with |S| = k, G has a spanning tree such that S is the set of endvertices.
A note on a spanning 3-tree
It is proved that if G is an n-connected graph with independence number at most n + m + 1 (n≥1, n≥m≥0), then G has a spanning 3-tree T with at most m vertices of degree 3.