Spanning tree with lower bound on the degrees

Finally, we give a shorter proof and a polynomial time algorithm for a good characterization of having a spanning tree with prescribed degree lower bounds, for the special case when G[S] is a cograph, where S is the set of the vertices having degree lower bound prescription at least two. This theorem was proved by Egawa and Ozeki in 2014 while they did not give a polynomial time algorithm.