相关论文: Sampling planar tanglegrams and pairs of disjoint …

A binary tanglegram is a pair <S,T> of binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example in phylogenetics or software engineering, it is required…

A tanglegram consists of two binary rooted trees with the same number of leaves and a perfect matching between the leaves of the trees. We show that the two halves of a random tanglegram essentially look like two independently chosen random…

Tanglegrams are a special class of graphs appearing in applications concerning cospeciation and coevolution in biology and computer science. They are formed by identifying the leaves of two rooted binary trees. We give an explicit formula…

Tanglegrams are formed by taking two rooted binary trees $T$ and $S$ with the same number of leaves and uniquely matching each leaf in $T$ with a leaf in $S$. They are usually represented using layouts, which embed the trees and the…

Tanglegrams are special graphs that consist of a pair of rooted binary trees with the same number of leaves, and a perfect matching between the two leaf-sets. These objects are of use in phylogenetics and are represented with straightline…

A tanglegram consists of two rooted binary plane trees with the same number of leaves and a perfect matching between the two leaf sets. Tanglegrams are drawn with the leaves on two parallel lines, the trees on either side of the strip…

A tanglegram of size n is a graph formed from two rooted binary trees with n leaves each and a perfect matching between their leaf sets. Tanglegrams are used to model co-evolution in various settings. A tanglegram layout is a straight line…

A tanglegram consists of two rooted binary trees with the same number of leaves and a perfect matching between the leaves of the trees. Given a size-$n$ tanglegram, i.e., a tanglegram for two trees with $n$ leaves, a multiset of induced…

Tanglegrams are drawings of two rooted binary phylogenetic trees and a matching between their leaf sets. The trees are drawn crossing-free on opposite sides with their leaf sets facing each other on two vertical lines. Instead of minimizing…

A \emph{binary tanglegram} is a drawing of a pair of rooted binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example, in phylogenetics, it is essential…

We present a bijection between some quadrangular dissections of an hexagon and unrooted binary trees, with interesting consequences for enumeration, mesh compression and graph sampling. Our bijection yields an efficient uniform random…

A tanglegram $\cal T$ consists of two rooted binary trees with the same number of leaves, and a perfect matching between the two leaf sets. In a layout, the tanglegrams is drawn with the leaves on two parallel lines, the trees on either…

Flips in triangulations of convex polygons arise in many different settings. They are isomorphic to rotations in binary trees, define edges in the 1-skeleton of the Associahedron and cover relations in the Tamari Lattice. The complexity of…

A tanglegram is a pair of binary trees with the same set of leaves. Unlabeled tanglegrams were counted recently by Billey, Konvalinka, and Matsen, who also proposed the problem of counting several variations of unlabeled tanglegrams…

This article focuses on a combinatorial structure specific to triangulated plane graphs with quadrangular outer face and no separating triangle, which are called irreducible triangulations. The structure has been introduced by Xin He under…

Triangulations of the 5-gon with no separating triangle nor quadrangle, so called 5c-triangulations, are a planar map family closely related to 5-connected planar triangulations. We show that 5c-triangulations are in bijection with…

A triangulation of a polygon is a subdivision of it into triangles, using diagonals between its vertices. Two different triangulations of a polygon can be related by a sequence of flips: a flip replaces a diagonal by the unique other…

In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed…

A flip in a plane spanning tree $T$ is the operation of removing one edge from $T$ and adding another edge such that the resulting structure is again a plane spanning tree. For trees on a set of points in convex position we study two…

Plane perfect matchings of $2n$ points in convex position are in bijection with triangulations of convex polygons of size $n+2$. Edge flips are a classic operation to perform local changes both structures have in common. In this work, we…