|
2
|
Fullerenes and Coordination Polyhedra versus Half-Cubes Embeddings
– Antoine Deza, Michel Deza, Viatcheslav Grishukhin
- 1997
|
|
3
|
Recent Excluded Minor Theorems
– Robin Thomas
|
|
3
|
Nonhamiltonian 3-connected cubic planar graphs
– R. E. L. Aldred, S. Bau, D. A. Holton, Brendan D. Mckay
|
|
5
|
Recent Excluded Minor Theorems for Graphs
– Robin Thomas
- 1999
|
|
12
|
Enumeration and random realization of triangulated surfaces.arXiv:math.CO
– Frank H. Lutz
|
|
2
|
Zigzags, railroads and knots in fullerenes
– M. Deza, M. Dutour, P. W. Fowler
- 2004
|
|
|
The symmetries of cubic polyhedral graphs with face size no larger than 6
– Michel Deza, Mathieu Dutour Sikirić, Patrick W. Fowler
- 2009
|
|
13
|
A Constructive Enumeration of Fullerenes
– Gunnar Brinkmann, Andreas W.M. Dress, Fakultat Fur Mathematik, Fakultat Fur Mathematik
|
|
|
Combinatorial Aspects of . . .
– Margaret M. Bayer, Carl W. Lee
- 1991
|
|
3
|
Inner Diagonals Of Convex Polytopes
– David Bremner, Victor Klee
- 1998
|
|
6
|
Polytope Skeletons And Paths
– Gil Kalai
|
|
1
|
Computers and Discovery in Algebraic Graph Theory
– Pierre Hansen, Hadrien Mélot
- 2001
|
|
3
|
Generating irreducible triangulations of surfaces
– Thom Sulanke
- 2006
|
|
|
Linear-time algorithms to color topological graphs
– Warren D. Smith
- 2005
|
|
11
|
A Linear-Time Algorithm For Testing The Inscribability Of Trivalent Polyhedra
– Michael B. Dillencourt, Warren D. Smith
- 1995
|
|
3
|
A Zoo of l_1-embeddable Polytopal Graphs
– Michel Deza, V.P. Grishuhkin
- 1996
|
|
9
|
Combinatorial optimization in geometry
– Igor Rivin
- 1999
|
|
17
|
On the Enumeration of Inscribable Graphs
– Warren D. Smith
- 1991
|
|
|
Growing Form-Filling Tensegrity Structures using Map L-Systems
– John Rieffel, Hod Lipson, Francisco J
|
