Counting unrooted planar maps

Two planar maps are identified if one can be transformed to the other by any homeomorphism of the sphere. The number of such maps is found by determining the numbers of maps which have been rooted in various ways.     

Enumerating rooted simple planar maps

The main purpose of this paper is to find the number of combinatorially distinct rooted simpleplanar maps,i.e.,maps having no loops and no multi-edges,with the edge number given.We haveobtained the following results.1.The number of rooted boundary loopless planar [m,2]-maps.i.e.,maps in which there areno loops on the boundaries of the outer faces,and the edge number is m,the number of edges on theouter face boundaries is 2,is(?)for m≥1.G_0~N=0.2.The number of rooted loopless planar [m,2]-maps is(?)3.The number of rooted simple planar maps with m edges H_m~s satisfies the following recursiveformula:(?)where H_m~(NL) is the number of rooted loopless planar maps with m edges given in [2].4.In addition,γ(i,m),i≥1,are determined by(?)for m≥i.γ(i,j)=0,when i>j.     

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 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 non-isomorphic three-connected planar maps

A counting formula for the number of non-isomorphic planar maps with m edges was obtained by V. A. Liskovets, and non-isomorphic 2-connected planar maps were counted by Liskovets and the author. R. W. Robinson's generalization of Polya's counting theory can be applied to these formulae to count, in polynomial time, non-isomorphic planar maps satisfying various sets of restrictions. Here two sets of planar maps are counted: maps with given 2-connected components, and 3-connected maps.     

An existence theorem for planar maps

The main result of this paper is a theorem concerning possible cubic maps on the plane or sphere. The dual approach of spherical triangulations will be used. Every such triangulation must contain a vertex of degree less than 8 and other than 5, or else contain one of a list of 5 configurations. Due to the occurrence of these five configurations in four color reduction arguments, this implies that a minimal five color map must have at least one face with six or seven neighbors. The theorem is given in Heesch [1, p. 129 ff.], but the proof here is much shorter, due to a modification of Heesch's principle of “discharging”. The principle itself is obtained by exploiting the Euler formula, and should be compared with the theory of Euler contributions as developed by Ore in [3], and by Ore and Stemple [4].     

Three-colourings of planar 4-valent maps

A strong face 3-colouring of a planar 4-valent map G is a 3-colouring of the faces such that there is a face of each colour at every vertex. Such a map is one-track if it contains an Eulerian path which at each vertex regarded as a cross-roads goes directly through. It is proved that every planar 4-valent map can be strongly face 3-coloured and this can be done in a unique way if and only if G is one-track. Formulas are obtained for the number of strong face 3-colourings and the number of all face 3-colourings.     

Global injectivity conditions for planar maps

We prove that a planar $C^1$ -smooth map $f:D\longrightarrow \mathbb{R }^{2n}$ , where $D\subseteq \mathbb{R }^{2n}$ is a convex open set, is injective if $\mathbb{R }\cap \mathrm{Spec}(df)_z=\emptyset $ for all $z\in D$ . We continue by showing that the triangulability of the differentials $(df)_z$ , $z\in D$ , ensure the global injectivity as well.     

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.     

Covalence sequences of planar vertex-homogeneous maps

Given a cyclic d-tuple of integers at least 3, we consider the class of all 1-ended 3-connected d-valent planar maps such that every vertex manifests this d-tuple as the (clockwise or counterclockwise) cyclic order of covalences of its incident faces. We obtain necessary and/or sufficient conditions for the class to contain a Cayley map, a non-Cayley map whose underlying graph is a Cayley graph, a vertex-transitive graph whose subgroup of orientation-preserving automorphisms acts (or fails to act) vertex-transitively, a non-vertex-transitive map, or no planar map at all.     

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.     

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

Counting colored planar maps: Algebraicity results

We address the enumeration of properly q-colored planar maps, or more precisely, the enumeration of rooted planar maps M weighted by their chromatic polynomial χM(q) and counted by the number of vertices and faces. We prove that the associated generating function is algebraic when q≠0,4 is of the form 2+2cos(jπ/m), for integers j and m. This includes the two integer values q=2 and q=3. We extend this to planar maps weighted by their Potts polynomial PM(q,ν), which counts all q-colorings (proper or not) by the number of monochromatic edges. We then prove similar results for planar triangulations, thus generalizing some results of Tutte which dealt with their proper q-colorings. In statistical physics terms, the problem we study consists in solving the Potts model on random planar lattices. From a technical viewpoint, this means solving non-linear equations with two “catalytic” variables. To our knowledge, this is the first time such equations are being solved since Tutte?s remarkable solution of properly q-colored triangulations.     

On planar zero-diagonal and zero-trace iterated maps

We call an iterated map zero-diagonal, if it has a zero-diagonal Jacobi matrix for all x,y. Similarly, zero-trace iterated maps are the maps with zero-trace Jacobi matrix. In this paper, we present some of the geometric and algebraic properties of zero-diagonal planar maps. However, the main focus of this paper is the analysis of the zero-trace planar maps by linear transforming them to a zero-diagonal ones. Some sufficient conditions for the transformation are obtained. Stability for non-hyperbolic fixed points, two types of codim-2 bifurcations, and the local/global invariant manifolds for zero-diagonal and zero-trace maps are investigated.     

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.