The number of nonseparable maps on the projective plane

In this paper, we study the rooted nonseparable maps on the sphere and the projective plane with the valency of root-face and the number of edges as parameters. Explicit expression of enumerating functions are obtained for such maps on the sphere and the projective plane. A parametric expression of the generating function is obtained for such maps on the projective plane, from which asymptotic evaluations are derived. Moreover, if the number of edges is sufficiently large, then almost all nonseparable maps on the projective plane are not triangulation.     

The number of rooted Eulerian planar maps

In this paper we provide a solution of the functional equation unsolved in the paper, by the second author, "On functional equations arising from map enumerations" that appeared in Discrete Math, 123: 93-109 (1993). It is also the number of combinatorial distinct rooted general eulerian planar maps with the valency of root-vertex, the number of non-root vertices and non-root faces of the maps as three parameters. In particular, a result in the paper, by the same author, "On the number of eulerian planar map...     

ON THE VERTEX PARTITION EQUATION OF ROOTED LOOPLESS PLANAR MAPS

This paper provides a functional equation astisfied by the generating function for enumerating rooted loopless planar maps with vertex partition. A kind of applications in enumerating, by providing explicit formulae, a type of rooted loopless planar maps with the maximum valency of vertices given are described. Meanwhile, the functional equation for enumerating rooted loopless planar maps (connected) with the edge number and the valency of root-vertex as the parameters is also derived directly.     

The number of rooted circuit boundary maps

In this article, the authors discuss two kinds of new planar maps： pan-fan maps and circuit boundary maps, and provide explicit expressions about their enumerating functions with different parameters. Meanwhile, two explicit counting formulas for circuit cubic boundary maps with two parameters; the size and the valency of the root-face, are also extracted.     

Enumeration of rooted planar halin maps

A Halin map is a kind of planar maps oriented by a tree. In this paper the rooted halin maps with the vertex partition as parameters are enumerated such that a famous result on rooted trees due to Harary. Prins, and Tutte is deduced as. a special ease. Further, by using Lagrangian inversion to obtain a number of summation free formulae dixectly, the various kinds of rooted Halin maps with up to three parameters have been counted.     

Enumeration of rooted nonseparable outerplanar maps

In this paper, the number of combinatorially distinct rooted nonseparable outerplanar maps withm edges and the valency of the root-face being n is found to be(m-1)! (m-2) !:(n-1)!(n-2)! (m-n)!(m-n 1)!and, the number of rooted nonseparable outerplanar maps with m edges is also determined to be(2m-2)!:(m-1)!m!,which is just the number of distinct rooted plane trees with m-1 edges.     

CHROMATIC ENUMERATION FORROOTED OUTERPLANAR MAPS

Let G(m,s,t,λ)be the number of ways of λ-coloring all the rooted nonseparableouterplanar maps which are simple and have the edge number m,the valency s of theroot-face,and the valency t of the root-vertex.The chromatic enumerating functiong(x,y,z;λ.)=G(m,s,t;λ)x~my~sz~tis determined.Meanwhile,a number of explicit formulae for enumerating this kindofmaps in general case and in Lipartite case are provided.     

BISINGULAR MAPS ON SOME SURFACES

A map is bisingular if each edge is either a loop (This paper only considersplanar loop) or an isthmus (i.e., on the boundary of the same face). This paper studies thenumber of rooted bisingular maps on the sphere and the torus, and also presents formulaefor such maps with three parameters: the root-valency, the number of isthmus, and thenumber of planar loops.     

ENUMERATING ROOTED LOOPLESS PLANAR MAPS

This paper provides the following results.1.The equivalence between the method described by W.T.Tutte for determining parametricexpressions of certain enumerating functions and the one which the author used in [2] for findingthe parametric expression of the generating function of rooted general planar maps dependent on theedge number,is shown.2.The number of rooted boundary loop maps,i.e.,maps for each of which all the edges on theboundary of the outer face are loops,with the edge number given is found.3.The number of rooted nearly loopless planar maps,i.e.,loopless maps and maps having exactlyone loop which is just the rooted edge and does not form the boundary of the outer face,with givenedge number is also found.4.The recursive formula satisfied by the number of rooted loopless planar maps dependent onthe edge number is derived.5.In addition,the number of loop rooted maps,i.e.,maps in each of which there is only one loopwhich is just the rooted edge,dependent on the edge number is obtained at the sam     

Counting rooted unicursal planar maps

This paper investigates the number of rooted unicursal planar maps and presents some formulae for such maps with four parameters： the numbers of nonrooted vertices and inner faces and the valencies of two odd vertices.     

Enumerating near-4-regular maps on the sphere and the torus

In this paper rooted near-4-regular maps on the plane and the torus are counted with formulae with respect to four parameters: the root valency, the number of edges, the inner faces, and nonroot-vertex loops. In particular, the number of rooted near-4-regular maps on those surfaces with exactly k nonroot-vertex loops is investigated.     

ENUMERATING ROOTED EULERIAN PLANAR MAPS

1 IntroductionSince Thtte's papers oll enunlerating planar InaPs in [7,8] published iu the beginlling Ofsixties, the enumerative theory has been developed greatly up to now. The enumeration ofgenera1 Eulerian planar maps is dependent on two paranleters as the valency of rooted vertexalld the uunther of edges Of the nmps. Y.P.Liu found tl1e functional equation firstly for thenlaPs aud then obtained the number of general rooted Elllerian planar maPs with the nuntherof edges given in 1989[1].…     

THE NUMBER OF ROOTED NEARLY CUBIC C-NETS

1. IntroductionW.T. Tutte's original papers[1--3) on the enumerative theory of rooted planar maps havebrought forth a series of papers on enumerating triangulations. The enumeration of generalrooted planar maps has then also been investigated and a number of elegant results havebeen obtained, although relatively fewer than that of triangulations. As the dual case oftriangulations, the enumerative theory of cubic maps has also been developed, though thereare a lot of problems waiting for solut…     

带根单行平面地图的计数

提供了根点为一个奇点的带根单行平面地图以其边数、根点次和非根奇点次为参数的生成函数所满足的一些函数方程,并且导出了这些函数的显式,它们有两个是无和式.     

The number of rooted nearly cubicC-nets

This paper provides the parametric expressions satisfied by the enumerating functions for rooted nearly cubicc-nets with the size and/or the root-vertex valency of the maps as the parameters via nonseparable nearly cubic maps. On this basis, two explicit expressions of the functions can be derived by employing Lagrangian inversion. This Research is supported by National Natural Science Foundation of China (No. 19831080).     

环面上一般有根地图的计数

这篇文章给出了环面上以内面个数，根面次和非根节点个数为参数的一般有根地图的计数方程，导出了以内面个数和非根节点个数为参数的这类地图的计数方程的精确解。作为推论，推出了以边数为参数的这类地图的个数，其近似解在文献[2]中已讨论。     

至多有两个无公共边圈的有根平面地图计数

本文研究至多有两个无公共边圈的有根平面地图,提出了这种地图的节点剖分计数函数和以它的根次、边数和一次点数为三个参数的计数函数所满足方程。     

Enumeration on Nonseparable Planar Maps

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 indirectly by considering some relations between nonseparable and general rooted planar maps. One of them is an answer to the open problem 6.1 in Liu (1983, Comb. Optim. CORR83-26, University of Waterloo).     

Counting rooted 4-regular unicursal planar maps

A map is 4-regular unicursal if all its vertices are 4-valent except two odd-valent vertices. This paper investigates the number of rooted 4-regular unicursal planar maps and presents some formulae for such maps with four parameters: the number of edges, the number of inner faces and the valencies of the two odd vertices.