Sciweavers

3 search results - page 1 / 1
» Enumeration of unrooted maps of a given genus
Sort
View
JCT
2006
100views more  JCT 2006»
13 years 4 months ago
Enumeration of unrooted maps of a given genus
Let Ng(f ) denote the number of rooted maps of genus g having f edges. An exact formula for Ng(f ) is known for g = 0 (Tutte, 1963), g = 1 (Arques, 1987), g = 2,3 (Bender and Canf...
Alexander Mednykh, Roman Nedela
DM
2010
76views more  DM 2010»
13 years 5 months ago
Enumeration of unrooted hypermaps of a given genus
Alexander Mednykh, Roman Nedela
GC
2006
Springer
13 years 4 months ago
The Semi-Arc Automorphism Group of a Graph with Application to Map Enumeration
A map is a connected topological graph cellularly embedded in a surface. For a given graph , its genus distribution of rooted maps and embeddings on orientable and non-orientable s...
Linfan Mao, Yanpei Liu, Erling Wei