Degree-constrained Spanning Tree - Formal Definition

Formal Definition

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

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:

    I will not let him stir
    Till I have used the approvèd means I have,
    With wholesome syrups, drugs, and holy prayers,
    To make of him a formal man again.
    William Shakespeare (1564–1616)

    Scientific method is the way to truth, but it affords, even in
    principle, no unique definition of truth. Any so-called pragmatic
    definition of truth is doomed to failure equally.
    Willard Van Orman Quine (b. 1908)