Counting unlabelled toroidal graphs with no K33-subdivisions
classification
🧮 math.CO
cs.DM
keywords
graphsunlabelledenumerationk33-subdivisionstechniquestoroidalapplycanonically
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.