Degree-constrained spanning tree - Wikipedia, the free encyclopedia

In graph theory, a degree-constrained spanning tree is a spanning tree where the maximum vertex degree is limited to a certain constant k.

en.wikipedia.org