Published: October 01, 2015Manuscript Received: April 30, 2015Released on J-STAGE: October 01, 2015Accepted: -
Advance online publication: -
Manuscript Revised: July 01, 2015
Given a graph G, a set of spanning trees of G are completely independent if for any vertices x and y, the paths connecting them on these trees have neither vertex nor edge in common, except x and y. In this paper, we prove that for graphs of order n, with n ≥ 6, if the minimum degree is at least n-2, then there are at least ⌊n/3⌋ completely independent spanning trees.
