๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Permutations with forbidden subsequences and nonseparable planar maps

โœ Scribed by S. Dulucq; S. Gire; J. West

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
823 KB
Volume
153
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Raney Paths and a Combinatorial Relation
Raney Paths and a Combinatorial Relationship between Rooted Nonseparable Planar Maps and Two-Stack-Sortable Permutations
โœ I.P. Goulden; J. West ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 673 KB

An encoding of the set of two-stack-sortable permutations (TSS) in terms of lattice paths and ordered lists of strings is obtained. These lattice paths are called Raney paths. The encoding yields combinatorial decompositions for two complementary subsets of TSS, which are the analogues of previously

Exact Enumeration of 1342-Avoiding Permu
Exact Enumeration of 1342-Avoiding Permutations: A Close Link with Labeled Trees and Planar Maps
โœ Miklรณs Bรณna ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 318 KB

Solving the first nonmonotonic, longer-than-three instance of a classic enumeration problem, we obtain the generating function H(x) of all 1342-avoiding permutations of length n as well as an exact formula for their number S n (1342). While achieving this, we bijectively prove that the number of ind

On planar intersection graphs with forbi
On planar intersection graphs with forbidden subgraphs
โœ Jรกnos Pach; Micha Sharir ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 154 KB

## Abstract Let ${\cal C}$ be a family of __n__ compact connected sets in the plane, whose intersection graph $G({\cal C})$ has no complete bipartite subgraph with __k__ vertices in each of its classes. Then $G({\cal C})$ has at most __n__ times a polylogarithmic number of edges, where the exponent

Structural Properties of Planar Maps wit
Structural Properties of Planar Maps with the Minimal Degree 5
โœ Oleg Borodin ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 371 KB

## Abstract We improve some old results concerning the numbers of such edges and faces in planar graphs having minimal degree 5 which are incident only to vertices of minor degrees.

The construction of cubic and quartic pl
The construction of cubic and quartic planar maps with prescribed face degrees
โœ Gunnar Brinkmann; Thomas Harmuth; Oliver Heidemeier ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 131 KB

In this paper, the existence and availability of computer programs to constructively enumerate all simple connected cubic or quartic planar maps with prescribed number of vertices and face degrees is announced and results of the programs are presented. The underlying algorithms of the computer progr