Geometric graph
Summary
A geometric graph is a graph drawn in the plane with its vertices as points and its edges as straight line segments, which may cross. Geometric graph theory asks how the positions of the points constrain the graph. A typical question is how many edges force two edges to cross. A geometric graph without crossings is a straight-line drawing of a planar graph. The subject sits between graph theory and discrete geometry.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | HFJCAPWWD4 |
|---|---|
| URI | m2://HFJCAPWWD4 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 05C62, 52C10, 05C10 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.