A closure result on spanning $k$-trees of graphs with given minimum degree

Wenqian Zhang

Let $k\ge 2$ be an integer. A $k$-tree is a tree with maximum degree at most $k$. In this paper, we give a closure result on spanning $k$-trees of graphs with given minimum degree.…