Kitaev, Sergey and de Mier, Anna and Noy, Marc (2014) On the number of self-dual rooted maps. European Journal of Combinatorics, 35. pp. 377-387. ISSN 0195-6698Full text not available in this repository. (Request a copy from the Strathclyde author)
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.
|Keywords:||self-dual rooted maps, fine numbers, embedded graphs, Electronic computers. Computer science, Computational Theory and Mathematics, Geometry and Topology, Theoretical Computer Science|
|Subjects:||Science > Mathematics > Electronic computers. Computer science|
|Department:||Faculty of Science > Computer and Information Sciences|
|Depositing user:||Pure Administrator|
|Date Deposited:||17 Oct 2014 10:08|
|Last modified:||22 Mar 2017 13:35|