Urquhart graph
Sign in to saveAlso known as UG
graph obtained by removing the longest edge from each triangle in the Delaunay triangulation
Also known as UG
graph obtained by removing the longest edge from each triangle in the Delaunay triangulation