Name
Abstract | ||
|---|---|---|
We describe the results of an enumeration of several classes of polyhedra. The enumerated classes include polyhedra with up 13 vertices, simplicial polyhedra with up to 16 vertices, 4-connected polyhedra with up to 15 vertices, non-Hamiltonian polyhedra with up to 15 vertices, bipartite polyhedra with up to 24 vertices, and bipartite trivalent polyhedra with up to 44 vertices. 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. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1006/jctb.1996.0008 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
small order,hamiltonian property,upper and lower bounds,satisfiability,planar graph | Discrete mathematics,Combinatorics,Vertex (geometry),Dual polyhedron,Bipartite graph,Polyhedron,Integer points in convex polyhedra,Balinski's theorem,Spherical polyhedron,Mathematics,Planar graph | Journal |
Volume | Issue | ISSN |
66 | 1 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
8 | 2.46 | 12 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael B. Dillencourt | 1 | 498 | 57.58 |