Is that each graph of minimum degree three admits a spanning tree whose vertices have degree three except the leaves?