✦ LIBER ✦

Enumeration of Unrooted Odd-Valent Regular Planar Maps

✍ Scribed by Zhicheng Gao; Valery A. Liskovets; Nicholas Wormald

Publisher: Springer
Year: 2009
Tongue: English
Weight: 350 KB
Volume: 13
Category: Article
ISSN: 0218-0006
DOI: 10.1007/s00026-009-0021-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumeration of nonisomorphic planar maps

✍ V. A. Liskovets 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB

The Enumeration of General Rooted Planar

The Enumeration of General Rooted Planar Maps

✍ Jun Liang Cai; Yan Pei Liu 📂 Article 📅 2004 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 172 KB

Three-colourings of planar 4-valent maps

✍ Kenneth A Berman 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 442 KB

Construction and enumeration of regular

Construction and enumeration of regular maps on the torus

✍ Amos Altshuler 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 652 KB

A construction is given for all the regular maps of type (3, 6} on the torus, with v vertices, v being any integer > 0. We also find bounds for the number of those maps, in particular for the case in which the maps contain "normal" Hamiltonian circuits. Using duality, the results may be applied for

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

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