Counting unlabelled toroidal graphs with no K33-subdivisions

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
25 pages (some corrections), 4 figures (one figure added), 3 tables

Keywords

Combinatorics, Discrete Mathematics, 05A15, 05C30 (Primary); 05C70, 05C75, 05C38 (Secondary)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/160233

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0509004
 http://arxiv.org/abs/math/0509004
 Adv. in Appl. Math. 39 (2007), no. 1, pp. 51-75
 doi:10.1016/j.aam.2006.05.006

Collections

arXiv