𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Han Ren; Yanpei Liu; Zhaoxiang Li


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
195 KB
Volume
23
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis


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 of rooted 4-regular maps such as 2-connected 4-regular planar maps, rooted 2-connected (connected) 4-regular planar maps without loops are also presented. Several known results on 4-regular maps and trees of Tutte are also concluded. Finally, asymptotic formulae for the numbers of those types of maps are given.


πŸ“œ SIMILAR VOLUMES


The Number of Loopless 4-Regular Maps on
✍ Han Ren; Yanpei Liu πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 175 KB

In this paper rooted loopless (near) 4-regular maps on surfaces such as the sphere and the projective plane are counted and exact formulae with up to three or four parameters for such maps are given. Several classical results on regular maps and one-faced maps are deduced.

On the Circumferences of Regular 2-Conne
✍ Bing Wei πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 135 KB

Let G be a 2-connected d-regular graph on n rd (r 3) vertices and c(G) denote the circumference of G. Bondy conjectured that c(G) 2nΓ‚(r&1) if n is large enough. In this paper, we show that c(G) 2nΓ‚(r&1)+2(r&3)Γ‚(r&1) for any integer r 3. In particular, G is hamiltonian if r=3. This generalizes a resu

On the edge-coloring problem for a class
✍ F. Jaeger; H. Shank πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 300 KB πŸ‘ 1 views

## Abstract A (plane) 4‐regular map __G__ is called __C__‐simple if it arises as a superposition of simple closed curves (tangencies are not allowed); in this case Οƒ (__G__) is the smallest integer __k__ such that the curves of __G__ can be colored with __k__ colors in such a way that no two curves

Erratum: On the edge-coloring problem fo
✍ F. Jaeger; H. Shank πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 37 KB πŸ‘ 1 views

On p. 272 of the above article, paragraph # 3 is incomplete. It should read as the following: Hence to prove Proposition 4 it is enough to show that the edges of Q 4 can be colored with 4 colors in such a way that each square has one edge of each color. Such a coloring is displayed on the following

Familial spastic paraparesis: Evaluation
✍ Raskind, Wendy H.; Pericak-Vance, Margaret A.; Lennon, Felicia; Wolff, John; Lip πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 259 KB πŸ‘ 2 views

Familial spastic paraparesis (SPG) is a clinically and genetically heterogeneous group of disorders. At least three loci have been implicated in autosomal dominant pure SPG and mutations in either of two loci may cause the X-linked form. Although the penetrance is high for all forms by age 60, there

ChemInform Abstract: One-Pot Synthesis o
✍ N. MIZUNO; H. HATAYAMA; M. MISONO πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons βš– 33 KB πŸ‘ 1 views

One-Pot Synthesis of VOHPO 4 β€’0.5H 2 O with High Growth of the (001) Plane: An Important Catalyst Precursor of (VO) 2 P 2 O 7 . -VOHPO 4 β€’0.5H 2 O is prepared in a one-pot synthesis and transformed to the catalyst by use of V metal as V source and as reducing agent. The synthesis is carried out by