A **string graph** is a type of intersection graph that can be constructed from a collection of continuous curves (strings) in a two-dimensional space. More formally, a string graph is defined as the graph whose vertices correspond to these curves, and there is an edge between two vertices if and only if the corresponding curves intersect at some point in the plane.
New to topics? Read the docs here!