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