Construction of planar triangulations with minimum degree 5 (1969)


Download Links

by G. Brinkmann , Brendan D. Mckay
Citations:3 - 1 self

Active Bibliography

Gunnar Brinkmann Fakultät für Mathematik – Universität Bielefeld, Brendan D. Mckay, Ulrike Von Nathusius
2 Fullerenes and Coordination Polyhedra versus Half-Cubes Embeddings – Antoine Deza, Michel Deza, Viatcheslav Grishukhin - 1997
3 Recent Excluded Minor Theorems – Robin Thomas
6 Nonhamiltonian 3-connected cubic planar graphs – R. E. L. Aldred, S. Bau, D. A. Holton, Brendan D. Mckay
9 Recent Excluded Minor Theorems for Graphs – Robin Thomas - 1999
13 Enumeration and random realization of triangulated surfaces.arXiv:math.CO – Frank H. Lutz
15 A Constructive Enumeration of Fullerenes – Gunnar Brinkmann, Andreas W.M. Dress, Fakultat Fur Mathematik, Fakultat Fur Mathematik
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
Journal of Graph Algorithms and Applications – Mahdieh Hasheminezhad, Brendan D. Mckay, Tristan Reeves, S. Das, R. Uehara - 2010
Generation of simple quadrangulations of the sphere Gunnar Brinkmann Fakultät für Mathematik – Universität Bielefeld, Catherine Greenhill, Robin Thomas, Sam Greenberg, Brendan D. Mckay, Paul Wollan
6 Polytope Skeletons And Paths – Gil Kalai
4 Inner Diagonals Of Convex Polytopes – David Bremner, Victor Klee - 1998
25 Combinatorial Aspects of Convex Polytopes – Margaret M. Bayer, Carl W. Lee - 1991
1 Computers and Discovery in Algebraic Graph Theory – Pierre Hansen, Hadrien Mélot - 2001
5 Generating irreducible triangulations of surfaces – Thom Sulanke - 2006
in a random planar triangulation – Zhicheng Gao, Gilles Schaeffer
Linear-time algorithms to color topological graphs – Warren D. Smith - 2005
On cubic planar hypohamiltonian and – Makoto Araya, Gábor Wiener