Degree-constrained Spanning Tree

In graph theory, a degree-constrained spanning tree is a spanning tree where the maximum vertex degree is limited to a certain constant k. The degree-constrained spanning tree problem is to determine whether a particular graph has such a spanning tree for a particular k.

Read more about Degree-constrained Spanning Tree:  Formal Definition, NP-completeness, Degree-constrained Minimum Spanning Tree, Approximation Algorithm

Famous quotes containing the word tree:

    “There was not a tree as far as we could see, and that was many miles each way, the general level of the upland being about the same everywhere. Even from the Atlantic side we overlooked the Bay, and saw to Manomet Point in Plymouth, and better from that side because it was the highest.”
    —Henry David Thoreau (1817–1862)