Category
page 1Geometric graphs
Steiner tree problem
class of problems in combinatorial mathematics
interval graph
intersection graph of a collection of intervals of the real line
polyhedral graph
3-connected simple planar graph
nearest neighbor graph
type of directed graph
unit distance graph
node-link graph of points in the plane, adjacent when their distance is exactly one
matchstick graph
graph that has a planar unit distance embedding
permutation graph
graph whose vertices represent the elements of a permutation
Levi graph
bipartite graph associated with an incidence structure
Gabriel graph
graph defined from a set of points in the Euclidean plane
unit disk graph
intersection graph of unit disks in the plane
Euclidean minimum spanning tree
the shortest network collecting a given set of points in the plane
planar straight-line graph
representation of a given graph in computational geometry
relative neighborhood graph
undirected graph used in computational geometry
visibility graph
graph of intervisible locations in computational geometry
circle graph
a type of node-link graph in which vertices represent chords of a circle and edges represent crossings
Urquhart graph
graph obtained by removing the longest edge from each triangle in the Delaunay triangulation
Laman graph
graphs describing the minimally rigid systems of rods and joints in the plane