Urquhart graph
graph obtained by removing the longest edge from each triangle in the Delaunay triangulation
Facts
3 properties- Subclass of
- planar graph, neighborhood graph[1][2]
- Part of
- Gabriel graph[3]
🏷️ Also known as
en UG
en Urquhart graph
de Urquhartgraph
de Urquhart-Graph
fr Graphe d'Urquhart
nl UG
nl Urquhartgraaf
ru Граф Уркхарта
uk граф Уркгарта
🔖 Identifiers · 3
- Image (Wikimedia Commons)
- Urquhart graph.svg ↗
- Freebase ID
- /m/080d7__
- Graphclasses.org ID
- gc_1223
🔗 Connections
Has these parts 1
Maintained by WikiProject 1
Part of 1
Subclass of 1
Press Enter · cited answer in seconds