Counting unlabelled toroidal graphs with no K33-subdivisions
arXiv:math/0509004 · doi:10.1016/j.aam.2006.05.006
Abstract
We provide a description of unlabelled enumeration techniques, with complete proofs, for graphs that can be canonically obtained by substituting 2-pole networks for the edges of core graphs. Using structure theorems for toroidal and projective-planar graphs containing no K33-subdivisions, we apply these techniques to obtain their unlabelled enumeration.
25 pages (some corrections), 4 figures (one figure added), 3 tables