---
tag: VN7F4DS518
kind: concept
name: String graph
sources:
  - wikipedia: en:16081202@r1315883005
    locator: String graph
    note: adopted
    mention: wikipedia://en/16081202
    sections: [Summary]
same_as:
  wikidata: Q7623978
  wikipedia: String graph
inventory: [1K74066YRR]
---

## Summary

In graph theory, a **string graph** is an intersection graph of curves in the plane; each curve is called a "string". Given a [[graph|00C0BR7D7H]] $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|00CT0PTH74]] to $G$.