有根不可分离平面偶地图的计数

本文给出了由边数和根面的次作为指标的有根不可分离平面偶地图的计数函数所满足的函效方程,此方程是三次的。而,有根一般平面偶地图的相应计数函数所满足的方程却是二次的。从此后一个方程出发得到了上面提到的二个计数函数的具体形式。同时,发现了这个有根不可分离平面偶地图的计数函数与Fabonacci叙列的关系。     

有根无环平面地图节点剖分计数方程

一个平面地图,如果无有边是环,则称为是无环的.有根的意义与[1]中的相同.在那里对于此类地图的一些计数问题作了研究,但从未触及到节点剖分.这篇文章的主要目的在于研究这类地图的依节点剖分的计数.求出了有根无环平面地图依节点剖分计数的母函数所满足的一个泛函方程.并且,作为这一方程的一种应用,求出了一类在节点的最大次给定情况下的有根无环平面地图依节点剖分计数的一些结果.     

关于广义冬梅地图的计数(英文)

本文提供了广义冬梅地图以根点次,非根点数和内面数为参数的计数函数所满足的一些函数方程,其中有两个为三次方程,并进一步导出了它们的计数显式。     

关于双奇异平面地图的计数

本文讨论了带根双奇异平面地图的计数问题,提供了以根面次、度和内面数为参数及以根面次、奇异边数和自环数为参数的计数函数所满足的计数方程,并且导出了所有的计数显式.     

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

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

近三正则3—连通平面地图的计数

本文提供了便于依根点次,边数和根面次计数近三正则3－连通有根平面地图的一个函数方程,继之得到其参数形式解,并由此通过Lagrange反演导出了它的计数显示,本文推广了[3]和[4]的结果。     

关于有根外平面地图的计数

本文在刘彦佩[1]、[2]两文提出的关于外平面地图的一般计数理论的基础上,进一步确定出了有限不可分离、带限制、一般、无环、简单以及 Euler 这几类外平面地图依边数和根节点的次两个参数的计数显式.     

平面上一般地图的色和与双色和

本文研究了平面上一般带根地图的色和与双色和,得到了这类地图的色和与双色和函数方程。从这类地图的色和函数方程,导出了平面上一般无环地图、平面上二部地图和平面上欧拉地图的计数函数方程。还得到了一些计数函数的计数显式。     

带根2-连通3-正则平面地图计数

本文利用不可分离的3-正则有根平面地图的计数结果,间接地给出了2-连通 3-正则有根平面地图依边数和根面次的计数显式．     

带根单行平面地图的计数

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

环面上有根欧拉地图的计数

本文探讨了环面上有限欧拉迹的计算并且提供了一个解析表达式．在此基础上，我们给出了环面上有根欧地图的计算公式．     

关于平面上双树梵和的一个注记

这篇文章得到了以根节点的次、割边的个数及环的个数为参数的双树梵和的色和方程，且导出了这类地图带以上三个参数的精确解及一些退化的情形。     

Enumeration of maps on the projective plane

1. IntroductionA lnap is rooted if an edge is distinguished togetl1er with an end and a side of the edge.An edge belo11ging to only one face is called double (or 8ingular by some author), al1 othersbelonging to exactly two faces are called s1ngle. The enumeration of rooted p1anar maps wasfirst introduced by Tutte['], Techniques originated by Tutte [2,3l for enumerating variousclasses of rooted Inaps on tIle sphere are here applied to the c1asses of alI rooted maps onthe projective plane. Th…     

数有根近2-正则平面地图

The number of rooted nearly 2-regular maps with the valency of root-vertex, the number of non-rooted vertices and the valency of root-face as three parameters is obtained. Furthermore, the explicit expressions of the special cases including loopless nearly 2-regular maps and simple nearly 2-regular maps in terms of the above three parameters are derived.     

Chromatic sum equations for rooted cubic planar maps

This paper provides a functional equation satisfied by rooted nearly cubic planar maps. By a nearly cubic map is meant such a map that all the vertices have valency 3 with the exception of at most the root-vertex. And, as a consequence, the corresponding functional equation for rooted cubic planar maps is found.     

图的可定向嵌入的标根可数性

给定一族图G,可定向曲面上存在多少个以其中某个图为基础图的标根地图？采用图的自同构群对图在可定向曲面上的嵌入集合进行分类，该文解决了这个问题，同时得到了求解计数函数f^r(M)的一种新的方法。     

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).     

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].…     

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.