✦ LIBER ✦

Enumeration of nonisomorphic planar maps

✍ Scribed by V. A. Liskovets

Publisher: John Wiley and Sons
Year: 1981
Tongue: English
Weight: 123 KB
Volume: 5
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190050110

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumeration on Nonseparable Planar Maps

✍ Junliang Cai; Yanpei Liu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 206 KB

This paper provides some functional equations satisfied by the generating functions for nonseparable rooted planar maps with the valency of root-vertex, the number of edges and the valency of root-faces of the maps as three parameters. But the solutions of these equations can only be obtained indire

Enumeration of Planar Constellations

✍ Mireille Bousquet-Mélou; Gilles Schaeffer 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 270 KB

The enumeration of transitive ordered factorizations of a given permutation is a combinatorial problem related to singularity theory. Let n ≥ 1, and let σ 0 be a permutation of n having d i cycles of length i, for i ≥ 1. Let m ≥ 2. We prove that the number of m-tuples σ 1 σ m of permutations of n su

Exact Enumeration of 1342-Avoiding Permu

Exact Enumeration of 1342-Avoiding Permutations: A Close Link with Labeled Trees and Planar Maps

✍ Miklós Bóna 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 318 KB

Solving the first nonmonotonic, longer-than-three instance of a classic enumeration problem, we obtain the generating function H(x) of all 1342-avoiding permutations of length n as well as an exact formula for their number S n (1342). While achieving this, we bijectively prove that the number of ind

Enumeration of 2 -connected Loopless 4 -

Enumeration of 2 -connected Loopless 4 -regular Maps on the Plane

✍ Han Ren; Yanpei Liu; Zhaoxiang Li 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 195 KB

In this paper rooted (near-) 4-regular maps on the plane are counted with respect to the root-valency, the number of edges, the number of inner faces, the number of non-root vertex loops, the number of non-root vertex blocks, and the number of multi-edges. As special cases, formulae of several types

Enumeration of Rooted Planar Triangulati

Enumeration of Rooted Planar Triangulations with Respect to Diagonal Flips

✍ Zhicheng Gao; Jianyu Wang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 288 KB

We use the generating function approach to enumerate two families of rooted planar near-triangulations (2-connected, and 2-connected with no multiple edges) with respect to the number of flippable edges. It is shown that their generating functions are algebraic. Simple explicit expressions are obtai

A Pattern of Asymptotic Vertex Valency D

A Pattern of Asymptotic Vertex Valency Distributions in Planar Maps

✍ Valery A Liskovets 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 159 KB

Let a vertex be selected at random in a set of n-edged rooted planar maps and p k denote the limit probability (as n Ä ) of this vertex to be of valency k. For diverse classes of maps including Eulerian, arbitrary, polyhedral, and loopless maps as well as 2-and 3-connected triangulations, it is show