## Polyhedra of Small Order and Their Hamiltonian Properties (1995)

by
Michael B. Dillencourt

Citations: | 8 - 1 self |

### BibTeX

@MISC{Dillencourt95polyhedraof,

author = {Michael B. Dillencourt},

title = {Polyhedra of Small Order and Their Hamiltonian Properties},

year = {1995}

}

### OpenURL

### Abstract

... The results of the enumeration were used to systematically search for certain smallest non-Hamiltonian polyhedral graphs. In particular, the smallest non-Hamiltonian planar graphs satisfying certain toughness-like properties are presented here, as are the smallest non-Hamiltonian, 3-connected, Delaunay tessellations and triangulations. Improved upper and lower bounds on the size of the smallest non-Hamiltonian, inscribable polyhedra are also given.