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:

    The wind had seized the tree and ha, and ha,
    It held the shivering, the shaken limbs,
    Then bathed its body in the leaping lake.
    Wallace Stevens (1879–1955)