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:

    “[T]ea, that uniquely English meal, that unnecessary collation at which no stimulants—neither alcohol nor meat—are served, that comforting repast of which to partake is as good as second childhood.”
    —Angela Carter (1940–1992)

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