In order to enumerate two-face maps, we first express the species of two-face plane maps in terms of circular permutations and of planted plane trees (see ...

We enumerate unrooted planar maps (up to orientation-preserving homeomorphism) having two faces, according to the number of vertices and to their vertex and ...

We enumerate unrooted planar maps (up to orientation-preserving homeomorphism) having two faces, according to the number of vertices and to their vertex and ...

Efficient enumeration of sensed planar maps · Enumeration of chordal planar graphs and maps · Enumeration of eulerian and unicursal planar maps.

Oct 24, 2022 · The theory of planar map enumeration was started by Tutte and iniciated the theory of map enumeration when trying to solve the 4-colour ...

We enumerate unrooted planar maps (up to orientation preserving homeomorphism) having two faces, according to the number of vertices and to their vertex and ...

Sep 15, 2023 · Two embeddings of a planar graph are equivalent when the boundary of a face in one embedding always corresponds to the boundary of a face in the other.

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

Thus a link-map has exactly one face and a loop-map exactly two. Two planar maps are combinatorially equivalent if there is a homeo- morphism of the surface ...

Oct 11, 2024 · We consider planar bipartite maps which are both tight, ie without vertices of degree 1, and 2b-irreducible, ie such that each cycle has length at least 2b.