In graph theory, a string graph is an intersection graph of curves in the plane; each curve is called a "string". Given a graph G, G is a string graph if and only if there exists a set of curves, or strings, drawn in the plane such that no three strings intersect at a single point and such that the graph having a vertex for each curve and an edge for each intersecting pair of curves is isomorphic to G.
Read more about String Graph: Background, Related Graph Classes, Other Results
Famous quotes containing the words string and/or graph:
“The string quartet plays for itself,
gently, gently, sleeves and waxy bows.”
—Anne Sexton (1928–1974)
“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)