Counting unlabelled toroidal graphs with no K33-subdivisions
Combinatorics
2008-05-06 v2 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.math/0509004,
title = {Counting unlabelled toroidal graphs with no K33-subdivisions},
author = {Andrei Gagarin and Gilbert Labelle and Pierre Leroux},
journal= {arXiv preprint arXiv:math/0509004},
year = {2008}
}
Comments
25 pages (some corrections), 4 figures (one figure added), 3 tables