String graph
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 , 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 .
Further reading
- Wikipedia, page 16081202, revision 1315883005, String graph. adopted
About this page
| Tag | VN7F4DS518 |
|---|---|
| URI | m2://VN7F4DS518 |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.