Uniquely Colorable Graph

In graph theory, a uniquely colorable graph is a k-chromatic graph that has only one possible (proper) k-coloring up to permutation of the colors.

Read more about Uniquely Colorable Graph:  Examples, Properties

Famous quotes containing the words uniquely and/or graph:

    “Poetry has no goal other than itself; it can have no other, and no poem will be so great, so noble, so truly worthy of the name of poem, than one written uniquely for the pleasure of writing a poem.”
    —Charles Baudelaire (1821–1867)

    “When producers want to know what the public wants, they graph it as curves. When they want to tell the public what to get, they say it in curves.”
    —Marshall McLuhan (1911–1980)