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

@article{Ren2002EnumerationO2,
  title={Enumeration of 2 -connected Loopless 4 -regular Maps on the Plane},
  author={Han Ren and Yanpei Liu and Zhaoxiang Li},
  journal={Eur. J. Comb.},
  year={2002},
  volume={23},
  pages={93-111}
}
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… 

Counting 2-Connected 4-Regular Maps on the Projective Plane

In this paper the number of rooted (near-) 4-regular maps on the projective plane are investigated with respect to the root-valency, the number of edges, the number of inner faces, the number of

4-edge-connected 4-regular Maps on the Projective Plane

TLDR
Using Darboux’s method, a nice asymptotic formula for the numbers of this type of maps is given which implies that almost every (loopless) 4 -regular map on the projective plane has a separating cycle.

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

The Enumeration of Rooted 4-regular Unicursal Planar Maps

This paper investigates the number of rooted 4-regular unicursal planar maps and presents some formulae for such maps with three parameters: the number of nonrooted vertices and the valencies of two

Classification of Half Planar Maps

We characterize all translation invariant half planar maps satisfying a certain natural domain Markov property. For p-angulations with p \ge 3 where all faces are simple, we show that these form a

Improved Enumeration of Simple Topological Graphs

  • J. Kynčl
  • Mathematics
    Discret. Comput. Geom.
  • 2013
TLDR
It is proved that for every graph G with n vertices, m edges and no isolated vertices the number of weak isomorphism classes of simple topological graphs that realize G is at most 2, and at least 2 for graphs with m>(6+\varepsilon )n$$m>(6-ε)n.

The Number of Rooted Nearly 2-Regular Loopless Planar Maps

: This paper investigates the enumeration of rooted nearly 2-regular loopless planar maps and presents some formulae for such maps with the valency of the root-face, the numbers of nonrooted vertices

References

SHOWING 1-10 OF 26 REFERENCES

On the enumeration of planar maps

A planar map is determined by a finite connected nonnull graph embedded in the 2-sphere or closed plane. It is permissible for the graph to have loops or multiple joins. It separates the remainder of

4-Regular Maps on the Klein Bottle

TLDR
The number of rooted near-4-regular maps on the Klein bottle is investigated andformulae with up to four parameters are given and explicit formulae for counting (loopless) 4- regular maps on this surface are deduced.

A Census of Slicings

  • W. T. Tutte
  • Mathematics
    Canadian Journal of Mathematics
  • 1962
A band is a closed connected set in the 2-sphere, bounded by one or more disjoint simple closed curves. Consider a band B with bounding curves J1, J2 , … , Jk . On each curve Ji let there be chosen

Some Asymptotical Estimates for Planar Eulerian Maps

  • V. Liskovets
  • Mathematics
    Combinatorics, Probability and Computing
  • 1996
In this paper, asymptotical estimates of the form Rn(1+o(1)) for various classes of planar valency-restricted Eulerian maps are established. It follows, in particular, that ‘almost all’ (as n → ∞)

Enumeration of Quadrangular Dissections of the Disk

  • W. G. Brown
  • Mathematics
    Canadian Journal of Mathematics
  • 1965
A dissection of the disk will be a cell complex (1, p. 39) K with polyhedron the closed disk B 2. It will further be required that: (a) every edge of K be incident with two distinct vertices (called

A Census of Planar Maps

  • W. T. Tutte
  • Mathematics
    Canadian Journal of Mathematics
  • 1963
In the series of "Census" papers, of which this is the fourth, we attempt to lay the groundwork of an enumerative theory of planar maps (12, 13, 14). The maps concerned are rooted in the sense that

Enumerative theory of maps

Preface. 1. Preliminaries. 1.1. Maps. 1.2. Polynomials on maps. 1.3. Enufunctions. 1.4. Polysum functions. 1.5. The Lagrangian inversion. 1.6. The shadow functional. 1.7. Asymptotic estimation. 1.8.