High Quality Content by WIKIPEDIA articles! 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.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.