Bisingular maps on the torus

A map is bisingular if each edge is either a loop or an isthmus (i.e., on the boundary of the same face). In this paper we study the number of rooted bisingular maps on the sphere and the torus, and we also present formula for such maps with four parameters: the root-valency,the number of isthmus, the number of planar loops and the number of essential loops.     

Klein瓶上的双奇异地图

一个地图的每条边如果不是环就是割边(即该边的两边是同一个面的边界)，则称之为双奇异地图，本文研究Klein瓶上带根双奇异地图的计数问题，得到了此类地图以边数、平面环数、手柄上本质环数和又帽上本质环数为参数的计数公式，并得到了部分计数显式。     

有根平面图计数

This is basically an expository paper on counting rooted planar maps as a part of the enumerative theory of planar maps which was founded by W.T. Tutte in the sixties.However, several new results and a certain number of simplifications and provided.     

A census of boundary cubic rooted planar maps

In this paper, boundary cubic rooted planar maps are investigated and exact enumerative formulae are given. First, an enumerative formula for boundary cubic inner-forest maps with the size (number of edges) as a parameter is derived. For the special case of boundary cubic inner-tree maps, a simple formula with two parameters is presented. Further, according to the duality, a corresponding result for outer-planar maps is obtained. Finally, some results for boundary cubic planar maps and general planar maps are obtained. Furthermore, two known Tutte's formulae are easily deduced in the paper.     

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.     

关于无环Euler平面地图数目的注记

本文提供了组合上不等价的有根无环Euler平面地图以边数为参数的的数目,同时对于几乎无环的情形也给出了一个计数显式.     

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

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.     

ENUMERATION OF ROOTED VERTEX NON-SEPARABLE PLANAR MAPS

In a rooted planar map, the rooted vertex is said to be non-separable if the vertex onthe boundary of the outer face as an induced graph is not a cut-vertex. In this paper, the author derives a functional equation satisfied by the enumeratingfuuction of rooted vertex non-separable planar maps dependent on the edge number and thenumber of the edges on the outer face boundary, finds a parametric expression of itssolution, and obtains an explicit formula for the function. Particularly, the number of rooted vertex non-separable maps only replying on theedge number and that of rooted vertex non-separable tree-like maps defined in [4] accordingto the two indices, the edge number and the number of the edges on the outer face boundary,or only one index, the edge number, are also determined.     

On the η‐function for bisingular pseudodifferential operators

In this work we consider the η‐invariant for pseudodifferential operators of tensor product type, also called bisingular pseudodifferential operators. We study complex powers of classical bisingular operators. We prove the trace property for the Wodzicki residue of bisingular operators and show how the residues of the η‐function can be expressed in terms of the Wodzicki trace of a projection operator. Then we calculate the K‐theory of the algebra of 0‐order (global) bisingular operators. With these preparations we establish the regularity properties of the η‐function at the origin for global bisingular operators which are self‐adjoint, elliptic and of positive orders.     

带根单行平面地图的计数

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

Enumerative Properties of Rooted Circuit Maps

In 1966, Barnette introduced a set of graphs, called circuit graphs, which are obtained from 3-connected planar graphs by deleting a vertex. Circuit graphs and 3-connected planar graphs share many interesting properties which are not satisfied by general 2-connected planar graphs. Circuit graphs have nice closure properties which make them easier to deal with than 3-connected planar graphs for studying some graph-theoretic properties. In this paper, we study some enumerative properties of circuit graphs. For enumeration purpose, we define rooted circuit maps and compare the number of rooted circuit maps with those of rooted 2-connected planar maps and rooted 3-connected planar maps.     

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

Les hypercartes planaires sont des arbres tres bien etiquetes

R. Cori and B. Vauquelin have constructed (cf[1]) a one to one correspondence from rooted planar maps onto rooted well-labeled trees (trees whose vertices are labeled with natural numbers that differ by at most one on adjacent vertices). This correspondence does not associate other families of planar maps (e.g. planar hypermaps,...) and easily definable families of trees. The main result of this paper (Theorem 1, Section II) is to construct a new one to one correspondence from rooted planar maps onto rooted well-labeled trees which also associates rooted planar hypermaps with n edge-ends (called ‘brin’ in French) and rooted very well-labeled trees (well labeled trees whose adjacent vertices have not the same label) with n edges. This last result is given in Section 3, Theorem 2.The coding of rooting very well-labeled trees by words extending Dyck's words (or parenthesis systems), allows their enumeration, hence the enumeration of rooted planar hypermaps. This side is the subject of a work in progress under B. Vauquelin.     

Counting unrooted maps on the plane

A planar map is a 2-cell embedding of a connected planar graph, loops and parallel edges allowed, on the sphere. A plane map is a planar map with a distinguished outside (“infinite”) face. An unrooted map is an equivalence class of maps under orientation-preserving homeomorphism, and a rooted map is a map with a distinguished oriented edge. Previously we obtained formulae for the number of unrooted planar n-edge maps of various classes, including all maps, non-separable maps, eulerian maps and loopless maps. In this article, using the same technique we obtain closed formulae for counting unrooted plane maps of all these classes and their duals. The corresponding formulae for rooted maps are known to be all sum-free; the formulae that we obtain for unrooted maps contain only a sum over the divisors of n. We count also unrooted two-vertex plane maps.     

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.     

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

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

Full 4-colorings of 4-regular maps

A full coloring of a planar map is a face coloring such that all the faces at ech vertex are colored differently. In this paper the planar 4-regular maps which have a full 4-coloring are characterized. This leads to a characterization of the planar maps (not necessarily 4-valent) which have a coupled 4-coloring.