Generating Rooted Triangulations with Minimum Degree Four
Download:
|
|
by David Avis, Chiu Ming Kong
http://cgm.cs.mcgill.ca/~avis/doc/avis/AK96a.ps.gz
Add To MetaCart
Abstract:
A graph is a triangulation if it is planar and every face is a triangle. A triangulation is rooted if the external triangular face is labelled. Two rooted triangulations with the same external face labels are isomorphic if their internal vertices can be labelled so that both triangulations have identical edge lists. In this article, we show that in the set of rooted triangulations on n points with minimum degree four, there exists a target triangulation E
Citations
| 301 | Graph Algorithms – Even - 1979 |
| 106 | Reverse search for enumeration – Avis, Fukuda - 1996 |
| 32 | The Four-Color Problem – Ore - 1967 |
| 16 | Generating rooted triangulations without repetitions – Avis - 1996 |
| 8 | The Graph of Triangulations of a Convex Polygon – Hurtado, Noy - 1996 |
| 1 | Wagner's theorem and combinatorial enumeration of 3-polytopes. Combinatorial Geometry B-271 – Deza, Fukuda, et al. - 1993 |
