
LINKS

Table of n, a(n) for n=4..40.
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]
G. Brinkmann and B. D. McKay, Construction of planar triangulations with minimum degree 5, Discr. Math. 301 (2005), 147163.
CombOS  Combinatorial Object Server, generate planar graphs
D. W. Grace, Search for largest polyhedra. Math. Comp. 17, 197199 (1963)
R. H. Hardin, N. J. A. Sloane and W. D. Smith, Spherical Codes with Icosahedral Symmetry.
Hugo Pfoertner, Icosahedral best coverings.
Sage, Common Graphs.
Thom Sulanke, Generating triangulations of surfaces (surftri), (also subpages).


EXAMPLE

With vertices denoted by letters a, b, ... the neighbor lists are for a(14)=1: (bcdef, afghc, abhid, acije, adjkf, aeklgb, bflmh, bgmic, chmnjd, dinke, ejnlf, fknmg, glnih, imlkj)
a(15)=1: (bcdefg, aghic, abijd, acjke, adklf, aelmg, afmhb, bgmni, bhnjc, cinokd, djole, ekomf, flonhg, hmoji, jnmlk); a(16)=3: (bcdef, afghc, abhijd, acjke, adklf, aelmgb, bfmnh, bgnic, chnoj, ciokd, djople, ekpmf, flpng, gmpoih, inpkj, konml), (bcdef, afghc, abhijd, acjke, adklf, aelmgb, bfmnh, bgnic, chnoj, ciopkd, djple, ekpmf, flpong, gmoih, inmpj, jomlk), (bcdef, afghijc, abjkd, ackle, adlmf, aemgb, bfmnh, bgnoi, bhopj, bipkc, cjpld, dkponme, elngf, gmloh, hnlpi, iolkj);
