DOIAbstract
Two planar maps are identified if one can be transformed to the other by any homeomorphism of the sphere. The number of such maps is found by determining the numbers of maps which have been rooted in various ways
Two planar maps are identified if one can be transformed to the other by any homeomorphism of the sphere. The number of such maps is found by determining the numbers of maps which have been rooted in various ways
AbstractThis paper provides some functional equations satisfied by the generating functions for nons...
International audienceA genus -ggmap is a 2-cell embedding of a connected graph on a closed, orie...
AbstractIn this paper rooted (near-) 4-regular maps on the plane are counted with respect to the roo...
Two planar maps are identified if one can be transformed to the other by any homeomorphism of the sp...
AbstractA general method for the counting of unrooted planar maps is proposed. It reduces the proble...
AbstractWe use Liskovets’ quotient maps and Robinson's cycle index sums to count 1-, 2- and 3-connec...
AbstractWe enumerate unrooted planar maps (up to orientation-preserving homeomorphism) having two fa...
AbstractA counting formula for the number of non-isomorphic planar maps with m edges was obtained by...
AbstractWe derive a simple formula for the number of rooted loopless planar maps with a given number...
AbstractA genus-g map is a 2-cell embedding of a connected graph on a closed, orientable surface of ...
We derive closed formulae for the numbers of rooted maps with a fixed number of vertices of the same...
A map is a connected graph embedded in a surface. Maps are topological objects which can be counted ...
AbstractWe present a formula for the number of n-edge unrooted loopless planar maps considered up to...
We present bijective proofs for the enumeration of planar maps and non-separable planar maps, and ap...
This paper investigates the enumeration of rooted nearly 2-regular loopless planar maps and presents...
AbstractThis paper provides some functional equations satisfied by the generating functions for nons...
International audienceA genus -ggmap is a 2-cell embedding of a connected graph on a closed, orie...
AbstractIn this paper rooted (near-) 4-regular maps on the plane are counted with respect to the roo...
Two planar maps are identified if one can be transformed to the other by any homeomorphism of the sp...
AbstractA general method for the counting of unrooted planar maps is proposed. It reduces the proble...
AbstractWe use Liskovets’ quotient maps and Robinson's cycle index sums to count 1-, 2- and 3-connec...
AbstractWe enumerate unrooted planar maps (up to orientation-preserving homeomorphism) having two fa...
AbstractA counting formula for the number of non-isomorphic planar maps with m edges was obtained by...
AbstractWe derive a simple formula for the number of rooted loopless planar maps with a given number...
AbstractA genus-g map is a 2-cell embedding of a connected graph on a closed, orientable surface of ...
We derive closed formulae for the numbers of rooted maps with a fixed number of vertices of the same...
A map is a connected graph embedded in a surface. Maps are topological objects which can be counted ...
AbstractWe present a formula for the number of n-edge unrooted loopless planar maps considered up to...
We present bijective proofs for the enumeration of planar maps and non-separable planar maps, and ap...
This paper investigates the enumeration of rooted nearly 2-regular loopless planar maps and presents...
AbstractThis paper provides some functional equations satisfied by the generating functions for nons...
International audienceA genus -ggmap is a 2-cell embedding of a connected graph on a closed, orie...
AbstractIn this paper rooted (near-) 4-regular maps on the plane are counted with respect to the roo...
Add to ORKG