Urquhart graph

graph obtained by removing the longest edge from each triangle in the Delaunay triangulation

Facts

3 properties
🏷️ 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

Report an error or request removal Lineage (PROV-JSON)

🔗 Connections
Has these parts 1
Maintained by WikiProject 1
Part of 1
Subclass of 1
Press Enter · cited answer in seconds

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Urquhart graph. Retrieved November 17, 2026, from https://4ort.xyz/entity/urquhart-graph
MLA “Urquhart graph.” 4ort.xyz Knowledge Graph, 4ort.xyz, 17 Nov. 2026, https://4ort.xyz/entity/urquhart-graph.
BibTeX @misc{4ortxyz_urquhart-graph_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Urquhart graph}}, year = {2026}, url = {https://4ort.xyz/entity/urquhart-graph}, note = {Accessed: 2026-11-17}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Urquhart graph — https://4ort.xyz/entity/urquhart-graph (retrieved 2026-11-17)

Canonical URL: https://4ort.xyz/entity/urquhart-graph · Last refreshed: