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)
“In this Journal, my pen is a delicate needle point, tracing out a graph of temperament so as to show its daily fluctuations: grave and gay, up and down, lamentation and revelry, self-love and self-disgust. You get here all my thoughts and opinions, always irresponsible and often contradictory or mutually exclusive, all my moods and vapours, all the varying reactions to environment of this jelly which is I.”
—W.N.P. Barbellion (1889–1919)