AbstractA general method for the counting of unrooted planar maps is proposed. It reduces the problem to the counting of rooted maps of several classes of three kinds: planar, projective and ‘circular’. The latter are reduced further (for the set of all maps) to certain generalized rooted quadrangular dissections of the disc. Their counting in a ‘closed’ form remains so far an open problem.The method is based upon an exhaustive classification of the periodic homeomorphisms of the geometrical sphere, including orientation-reversing ones, into five types. A general formula of enumerating under orthogonal actions of a group is also derived
Dedicated to the memory of Professor William T.Tutte Sum-free enumerative formulae are derived for s...
A map is a connected graph embedded in a surface. Maps are topological objects which can be counted ...
We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in t...
Two planar maps are identified if one can be transformed to the other by any homeomorphism of the sp...
AbstractWe present a formula for the number of n-edge unrooted loopless planar maps considered up to...
AbstractA counting formula for the number of non-isomorphic planar maps with m edges was obtained by...
AbstractWe use Liskovets’ quotient maps and Robinson's cycle index sums to count 1-, 2- and 3-connec...
We derive closed formulae for the numbers of rooted maps with a fixed number of vertices of the same...
Abstract. We present a formula for the number of n-edge unrooted loopless planar maps considered up ...
AbstractA genus-g map is a 2-cell embedding of a connected graph on a closed, orientable surface of ...
We present bijective proofs for the enumeration of planar maps and non-separable planar maps, and ap...
Abstract:- This is a survey paper presenting map enumeration results obtained by the author, either ...
International audienceA genus -ggmap is a 2-cell embedding of a connected graph on a closed, orie...
AbstractWe use the conceptual idea of “maps on orbifolds” and the theory of the non-Euclidean crysta...
AbstractWe enumerate unrooted planar maps (up to orientation-preserving homeomorphism) having two fa...
Dedicated to the memory of Professor William T.Tutte Sum-free enumerative formulae are derived for s...
A map is a connected graph embedded in a surface. Maps are topological objects which can be counted ...
We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in t...
Two planar maps are identified if one can be transformed to the other by any homeomorphism of the sp...
AbstractWe present a formula for the number of n-edge unrooted loopless planar maps considered up to...
AbstractA counting formula for the number of non-isomorphic planar maps with m edges was obtained by...
AbstractWe use Liskovets’ quotient maps and Robinson's cycle index sums to count 1-, 2- and 3-connec...
We derive closed formulae for the numbers of rooted maps with a fixed number of vertices of the same...
Abstract. We present a formula for the number of n-edge unrooted loopless planar maps considered up ...
AbstractA genus-g map is a 2-cell embedding of a connected graph on a closed, orientable surface of ...
We present bijective proofs for the enumeration of planar maps and non-separable planar maps, and ap...
Abstract:- This is a survey paper presenting map enumeration results obtained by the author, either ...
International audienceA genus -ggmap is a 2-cell embedding of a connected graph on a closed, orie...
AbstractWe use the conceptual idea of “maps on orbifolds” and the theory of the non-Euclidean crysta...
AbstractWe enumerate unrooted planar maps (up to orientation-preserving homeomorphism) having two fa...
Dedicated to the memory of Professor William T.Tutte Sum-free enumerative formulae are derived for s...
A map is a connected graph embedded in a surface. Maps are topological objects which can be counted ...
We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in t...