11 citations · 15 across the 2 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2015
Enumeration of Hypermaps of a Given Genus
Alain Giorgetti, Timothy R. S. Walsh
This paper addresses the enumeration of rooted and unrooted hypermaps of a given genus. For rooted hypermaps the enumeration method consists of considering the more general family…
math.CO2014★ 4 cited
Constructing large tables of numbers of maps by orientable genus
Alain Giorgetti, Timothy R. S. Walsh
The Carrell-Chapuy recurrence formulas dramatically improve the efficiency of counting orientable rooted maps by genus, either by number of edges alone or by number of edges and ve…
math.CO2008★ 11 cited
Two-connected graphs with prescribed three-connected components
Andrei Gagarin, Gilbert Labelle, Pierre Leroux +1
We adapt the classical 3-decomposition of any 2-connected graph to the case of simple graphs (no loops or multiple edges). By analogy with the block-cutpoint tree of a connected gr…