4 papers · 1 filter
Combinatorial generation via permutation languages. V. Acyclic orientations
Jean Cardinal, Hung P. Hoang, Arturo Merino +2
In 1993, Savage, Squire, and West described an inductive construction for generating every acyclic orientation of a chordal graph exactly once, flipping one arc at a time. We provi…
Combinatorial generation via permutation languages. III. Rectangulations
Arturo Merino, Torsten Mütze
A generic rectangulation is a partition of a rectangle into finitely many interior-disjoint rectangles, such that no four rectangles meet in a point. In this work we present a vers…
On flips in planar matchings
Marcel Milich, Torsten Mütze, Martin Pergel
In this paper we investigate the structure of flip graphs on non-crossing perfect matchings in the plane. Specifically, consider all non-crossing straight-line perfect matchings on…
Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane
Torsten Mütze, Bartosz Walczak, Veit Wiechert
It is shown that shift graphs can be realized as disjointness graphs of 1-intersecting curves in the plane. This implies that the latter class of graphs is not -bounded.