Counting unlabelled toroidal graphs with no K3, 3-subdivisions
A Gagarin, G Labelle, P Leroux - Advances in Applied Mathematics, 2007 - Elsevier
A Gagarin, G Labelle, P Leroux
Advances in Applied Mathematics, 2007•ElsevierWe 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.
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.
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.
Elsevier