String graph

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, such that the graph having a vertex for each curve and an edge for each intersecting pair of curves is isomorphic to $G$ .

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.