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:

    “Growing up human is uniquely a matter of social relations rather than biology. What we learn from connections within the family takes the place of instincts that program the behavior of animals; which raises the question, how good are these connections?”
    —Elizabeth Janeway (b. 1913)

    “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)