|
|
REFERENCES
|
G. Brinkmann and Brendan McKay, in preparation. [Looking at http://users.cecs.anu.edu.au/~bdm/publications.html,there are a few papers with Brinkmann that seem relevant, in particular #126 but also #97, 81, 158. Perhaps the right one is 126.]
M. B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties. Tech. Rep. 92-91, Info. and Comp. Sci. Dept., Univ. Calif. Irvine, 1992.
C. F. Earl and L. J. March, Architectural applications of graph theory, pp. 327-355 of R. J. Wilson and L. W. Beineke, editors, Applications of Graph Theory. Academic Press, NY, 1979.
P. J. Federico, Enumeration of polyhedra: the number of 9-hedra, J. Combin. Theory, 7 (1969), 155-161.
Fukuda, Komei; Miyata, Hiroyuki; Moriyama, Sonoko. Complete Enumeration of Small Realizable Oriented Matroids. Discrete Comput. Geom. 49 (2013), no. 2, 359--381. MR3017917. - From N. J. A. Sloane, Feb 16 2013
B. Grünbaum, Convex Polytopes. Wiley, NY, 1967, p. 424.
J. Lederberg, Hamilton circuits of convex trivalent polyhedra (up to 18 vertices), Am. Math. Monthly, 74 (1967), 522-527.
Sciriha, I. and Fowler, P.W., Nonbonding Orbitals in Fullerenes: Nuts and Cores in Singular Polyhedral Graphs J. Chem. Inf. Model., 47, 5, 1763 - 1775, 2007.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
A Stoimenow, A theorem on graph embedding with a relation to hyperbolic volume, Combinatorica, October 2016, Volume 36, Issue 5, pp 557-589
|
|
|
LINKS
|
David Wasserman, Table of n, a(n) for n = 3..23
J. Bokowski and P. Schuchert, Equifacetted 3-spheres as topes of nonpolytopal matroid polytopes, Discrete Comput. Geom. 13 (1995), no. 3-4, 347-361.
R. Bowen and S. Fisk, Generation of triangulations of the sphere [Annotated scanned copy]
R. Bowen and S. Fisk, Generation of triangulations of the sphere, Math. Comp., 21 (1967), 250-252.
Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph.
Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph [Cached copy, pdf file only, no active links, with permission]
M. Deza, M. Dutour and P. W. Fowler, Zigzags, railroads and knots in fullerenes, J. Chem. Inf. Comput. Sci., 44 (2004), 1282-1293.
F. H. Lutz, Triangulated manifolds with few vertices: Combinatorial Manifolds
G. P. Michon, Counting Polyhedra
Thom Sulanke, Generating triangulations of surfaces (surftri), (also subpages).
Eric Weisstein's World of Mathematics, Cubic Polyhedral Graph
Eric Weisstein's World of Mathematics, Simple Polyhedron
Eric Weisstein's World of Mathematics, Triangulated Graph
Index entries for "core" sequences
|
