136 search results - page 3 / 28 » On Touching Triangle Graphs |
CCCG
2007
13 years 8 months ago
2007
In this paper we study the problem of computing homothetic triangle contact representations of planar graphs. Since not all planar graphs admit such a representation, we concentra...
DAM
2007
13 years 7 months ago
2007
In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph w...
KDD
2009
ACM
14 years 7 months ago
2009
ACM
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
CGF
2004
13 years 6 months ago
2004
This paper describes a novel approach to the parameterization of triangle meshes representing 2-manifolds with an arbitrary genus. A topology-based decomposition of the shape is c...
COMBINATORICA
2008
13 years 7 months ago
2008
We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...