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:

    “I have great faith in ‘ordinary parents.’ Who has a child’s welfare more at heart than his ordinary parent? It’s been my experience that when parents are given the skills to be more helpful, not only are they able to use these skills, but they infuse them with a warmth and a style that is uniquely their own.”
    —Haim Ginott (20th century)

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