Skip to search formSkip to main contentSkip to account menu

Nested triangles graph

In graph theory, a nested triangles graph with n vertices is a planar graph formed from a sequence of n/3 triangles, by connecting pairs of… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
In a convex grid drawing of a plane graph, every edge is drawn as a straight-line segment without any edge-intersection, every… 
Review
2009
Review
2009
Depuis la fin des annees 1980, le probleme de l’interpolation parametrique de points et de normales sur des maillages… 
2007
2007
Despite a long research effort, finding the minimum area for straight-line grid drawings of planar graphs is still an elusive…