On certain Hamiltonian inner triangulations (Q2367404)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On certain Hamiltonian inner triangulations |
scientific article |
Statements
On certain Hamiltonian inner triangulations (English)
0 references
10 August 1993
0 references
An inner triangulation is a 2-connected planar graph all of whose interior faces are triangles. Some such graphs have the property of being simply-nested; that is, their vertices can be partitioned into nested cycles or nested cycles culminating in a tree. Presented is an algorithm, with its implementation, for finding a Hamiltonian cycle in a simply- nested inner triangulation.
0 references
Delaunay triangulation
0 references
inner triangulation
0 references
planar graph
0 references
algorithm
0 references
Hamiltonian cycle
0 references
simply-nested inner triangulation
0 references
