Construction of planar triangulations with minimum degree 5 (1969)

Cached

Download Links

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

Documents Related by Co-Citation

5 A generation procedure for the simple 3-polytopes with cyclically 5-connected graphs – J W Butler - 1974
4 Generating all 3connected 4-regular planar graphs from the octahedron graph – H J Broersma, A J W Duijvestijn, F Göbel - 1993
4 Generating all 4-regular planar graphs from the graph of the octahedron – J Lehel - 1981
1 A universal set of growth operations for fullerenes – M Hasheminezhad, H Fleischner, B D McKay
1 Recursive generation of 5-regular planar graphs – M Hasheminezhad, B D McKay, T Reeves - 2009
1 A generating theorem for 5-regular simple planar graphs – J Kanno, M Kriesell
7 An improved inductive definition of two restricted classes of triangulations of the plane – V Batagelj - 1989
31 A theory of 3-connected graphs – W T Tutte - 1961
8 Linear algorithms for testing isomorphism of planar graphs – M Fontet - 1976
8 Fast generation of planar graphs – Gunnar Brinkmann, Brendan D McKay
112 Isomorph-free exhaustive generation – B D McKay - 1998
121 Linear time algorithm for isomorphism of planar graphs (preliminary report – J E Hopcroft, J K Wong - 1974
2 Fullerenes and Coordination Polyhedra versus Half-Cubes Embeddings – Antoine Deza, Michel Deza, Viatcheslav Grishukhin - 1997
1 Skoviera, Constructing hypohamiltonian snarks with cyclic connectivity 5 and 6 – Edita Máčajová, Martin ˇ Skoviera
1 Spectral moments of fullerene graphs – D Cvetković, D Stevanović
1 Lower bound of cyclic edge connectivity for n-extendability of regular graphs – D Lou, D A Holton - 1993
1 Investigating Conjectures about Fullerenes, in ”Applications of Graph Theory to Chemistry” minisymposium – W J Myrvold
1 Four-dimensional football, fullerenes and diagram geometry, Discrete Math – A Pasini - 2001
3 Uniform cyclic edge connectivity in cubic graphs – R E L Aldred, D A Holton, B Jackson - 1991