Abstract
We compute the number of self-dual rooted maps with nn edges. We also compute the number of 2-connected and 3-connected self-dual rooted maps, and show that the latter are counted by the Fine numbers.
| Original language | English |
|---|---|
| Pages (from-to) | 377-387 |
| Number of pages | 11 |
| Journal | European Journal of Combinatorics |
| Volume | 35 |
| Early online date | 4 Jul 2013 |
| DOIs | |
| Publication status | Published - Jan 2014 |
Keywords
- self-dual rooted maps
- fine numbers
- embedded graphs
