Category:Geometric graphs
 | Computing portal |
Here is a list of articles in the category Geometric graphs of the Computing portal that unifies foundations of mathematics and computations using computers.
 |
Wikimedia Commons has media related to Geometric graphs. |
This category is for graphs defined in terms of relations for or structures of geometric objects.
Subcategories
This category has only the following subcategory.
T
Pages in category "Geometric graphs"
The following 34 pages are in this category, out of 34 total.
B
- Beta skeleton (computing)
C
- Circle graph (computing)
- Circular-arc graph (computing)
E
- Erdős–Diophantine graph (computing)
- Euclidean minimum spanning tree (computing)
G
- Gabriel graph (computing)
- Geometric spanner (computing)
- Greedy geometric spanner (computing)
H
- Hanan grid (computing)
- Hyperbolic geometric graph (computing)
I
- Indifference graph (computing)
- Interval graph (computing)
L
- Laman graph (computing)
- Levi graph (computing)
M
- Matchstick graph (computing)
N
- Nearest neighbor graph (computing)
P
- Penny graph (computing)
- Periodic graph (geometry) (computing)
- Permutation graph (computing)
- Planar straight-line graph (computing)
- Polyhedral graph (computing)
R
- Random geometric graph (computing)
- Rectilinear minimum spanning tree (computing)
- Rectilinear Steiner tree (computing)
- Relative neighborhood graph (computing)
- Rigid graph (computing)
S
- Semi-Yao graph (computing)
- Shortest-path graph (computing)
- Steiner tree problem (computing)
U
- Unit disk graph (computing)
- Unit distance graph (computing)
- Urquhart graph (computing)
V
- Visibility graph (computing)
W
- Wiener connector (computing)
Mathematics
Organizations
Books
About