| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4625374 | Advances in Applied Mathematics | 2007 | 25 Pages |
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 K3,3-subdivisions, we apply these techniques to obtain their unlabelled enumeration.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
