Add to ORKGIn this article we describe a method of constructing all simple triangulations of the sphere with minimum degree 5; equivalently, 3-connected planar cubic graphs with girth 5. We also present the results of a computer program based on this algorithm, including counts of convex polytopes of minimum degree 5. Key words: planar triangulation, cubic graph, generation, fulleren
A drawing of a graph can be understood as an arrangement of geometric objects. In the most natural s...
A drawing of a graph can be understood as an arrangement of geometric objects. In the most natural s...
A drawing of a graph can be understood as an arrangement of geometric objects. In the most natural s...
AbstractIn this article, we describe a method of constructing all simple triangulations of the spher...
In this article we describe a method of constructing all simple triangulations of the sphere with mi...
AbstractIn this article, we describe a method of constructing all simple triangulations of the spher...
A simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such that eve...
AbstractA simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such ...
A simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such that eve...
We describe two algorithms for the construction of simple planar cubic 3-connected graphs with all f...
Finding minimum triangulations of convex polyhedra is NPhard. The best approximation algorithms only...
We introduce a new method to optimize the required area, minimum angle and number of bends of planar...
This is a survey on methods to construct a three-dimensional convex polytope with a given combinator...
This is a survey on methods to construct a three-dimensional convex polytope with a given combinator...
AbstractIn this paper we consider the problem how to augment a planar graph to a triangulated planar...
A drawing of a graph can be understood as an arrangement of geometric objects. In the most natural s...
A drawing of a graph can be understood as an arrangement of geometric objects. In the most natural s...
A drawing of a graph can be understood as an arrangement of geometric objects. In the most natural s...
AbstractIn this article, we describe a method of constructing all simple triangulations of the spher...
In this article we describe a method of constructing all simple triangulations of the sphere with mi...
AbstractIn this article, we describe a method of constructing all simple triangulations of the spher...
A simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such that eve...
AbstractA simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such ...
A simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such that eve...
We describe two algorithms for the construction of simple planar cubic 3-connected graphs with all f...
Finding minimum triangulations of convex polyhedra is NPhard. The best approximation algorithms only...
We introduce a new method to optimize the required area, minimum angle and number of bends of planar...
This is a survey on methods to construct a three-dimensional convex polytope with a given combinator...
This is a survey on methods to construct a three-dimensional convex polytope with a given combinator...
AbstractIn this paper we consider the problem how to augment a planar graph to a triangulated planar...
A drawing of a graph can be understood as an arrangement of geometric objects. In the most natural s...
A drawing of a graph can be understood as an arrangement of geometric objects. In the most natural s...
A drawing of a graph can be understood as an arrangement of geometric objects. In the most natural s...