Degree-constrained Spanning Tree - Formal Definition

Formal Definition

Input: n-node undirected graph G(V,E); positive integer k ≤ n.

Question: Does G have a spanning tree in which no node has degree greater than k?

Read more about this topic:  Degree-constrained Spanning Tree

Famous quotes containing the words formal and/or definition:

    “Two clergymen disputing whether ordination would be valid without the imposition of both hands, the more formal one said, “Do you think the Holy Dove could fly down with only one wing?””
    —Horace Walpole (1717–1797)

    “One definition of man is “an intelligence served by organs.””
    —Ralph Waldo Emerson (1803–1882)