Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,857,562 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Fáry's theorem
Graph drawing
Graph theory
K-vertex-connected graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Convex Drawings of Internally Triconnected Plane Graphs on O(N2) Grids
Xiaoping Zhou
,
Takao Nishizeki
Discret. Math. Algorithms Appl.
2009
Corpus ID: 18671965
In a convex grid drawing of a plane graph, every edge is drawn as a straight-line segment without any edge-intersection, every…
Expand
Review
2009
Review
2009
Etat de l'art des méthodes d'interpolation locale de maillages triangulaires par des facettes non-planes C 0 -continues
Maria Boschiroli
,
Christoph Fünfzig
,
L. Romani
,
G. Albrecht
2009
Corpus ID: 18565643
Depuis la fin des annees 1980, le probleme de l’interpolation parametrique de points et de normales sur des maillages…
Expand
2007
2007
A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
Fabrizio Frati
,
M. Patrignani
International Symposium Graph Drawing and Network…
2007
Corpus ID: 2999501
Despite a long research effort, finding the minimum area for straight-line grid drawings of planar graphs is still an elusive…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE