Forbidden Graph Characterizations
Outerplanar graphs have a forbidden graph characterization analogous to Kuratowski's theorem and Wagner's theorem for planar graphs: a graph is outerplanar if and only if it does not contain a subdivision of the complete graph K4 or the complete bipartite graph K2,3. Alternatively, a graph is outerplanar if and only if it does not contain K4 or K2,3 as a minor, a graph obtained from it by deleting and contracting edges.
A triangle-free graph is outerplanar if and only if it does not contain a subdivision of K2,3.
Read more about this topic: Outerplanar Graph
Famous quotes containing the words forbidden and/or graph:
“I do not find fault with equality for drawing men into the pursuit of forbidden pleasures, but for absorbing them entirely in the search for the pleasures that are permitted.”
—Alexis de Tocqueville (1805–1859)
“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)