Counting unlabelled toroidal graphs with no K33-subdivisions
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
