EUDML | Baxter permutations and plane bipolar orientations.

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Baxter permutations and plane bipolar orientations.”

Edit distance between unlabeled ordered trees

Anne Micheli, Dominique Rossin (2006)

RAIRO - Theoretical Informatics and Applications

Similarity:

There exists a bijection between one-stack sortable permutations (permutations which avoid the pattern ) and rooted plane trees. We define an edit distance between permutations which is consistent with the standard edit distance between trees. This one-to-one correspondence yields a polynomial algorithm for the subpermutation problem for pattern-avoiding permutations. Moreover, we obtain the generating function of the edit distance between ordered unlabeled trees and some special ones. For...

Planar maps as labeled mobiles.

Bouttier, J., Di Francesco, P., Guitter, E. (2004)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Continued fractions and Catalan problems.

Jani, Mahendra, Rieper, Robert G. (2000)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees.

Schaeffer, Gilles (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Generalized Cauchy identities, trees and multidimensional Brownian motions. I: Bijective proof of generalized Cauchy identities.

Śniady, Piotr (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A note on major sequences and external activity in trees.

Beissinger, Janet S., Peled, Uri N. (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On the cutting edge: simplified $O (n)$ planarity by edge addition.

Boyer, John M., Myrvold, Wendy J. (2004)

Journal of Graph Algorithms and Applications

Similarity:

Bijective counting of tree-rooted maps and shuffles of parenthesis systems.

Bernardi, Olivier (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings.

Bernardi, Olivier (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On graceful trees.

Hegde, Suresh Manjanath, Shetty, Sudhakar (2002)

Applied Mathematics E-Notes [electronic only]

Similarity:

Matchings avoiding partial patterns.

Chen, William Y.C., Mansour, Toufik, Yan, Sherry H.F. (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On vertices and edges in maximum path-factors of a tree

Zdzisław Skupień, Władysław Zygmunt (1980)

Fundamenta Mathematicae

Similarity:

The absence of efficient dual pairs of spanning trees in planar graphs.

Riley, T.R., Thurston, W.P. (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity: