Counting unlabelled toroidal graphs with no K33-subdivisions
| dc.creator | Gagarin, Andrei | |
| dc.creator | Labelle, Gilbert | |
| dc.creator | Leroux, Pierre | |
| dc.date | 2005-09-01 | |
| dc.date | 2006-09-25 | |
| dc.date.accessioned | 2026-07-07T09:36:46Z | |
| dc.date.available | 2026-07-07T09:36:46Z | |
| dc.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. | |
| dc.description | 25 pages (some corrections), 4 figures (one figure added), 3 tables | |
| dc.identifier | https://arxiv.org/abs/math/0509004 | |
| dc.identifier | http://arxiv.org/abs/math/0509004 | |
| dc.identifier | Adv. in Appl. Math. 39 (2007), no. 1, pp. 51-75 | |
| dc.identifier | doi:10.1016/j.aam.2006.05.006 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/160233 | |
| dc.subject | Combinatorics | |
| dc.subject | Discrete Mathematics | |
| dc.subject | 05A15, 05C30 (Primary); 05C70, 05C75, 05C38 (Secondary) | |
| dc.title | Counting unlabelled toroidal graphs with no K33-subdivisions | |
| dc.type | text |