
Combinatorial generation via permutation languages. III. Rectangulations
A generic rectangulation is a partition of a rectangle into finitely man...
read it

On a combinatorial generation problem of Knuth
The wellknown middle levels conjecture asserts that for every integer n...
read it

On flips in planar matchings
In this paper we investigate the structure of a flip graph on noncrossi...
read it

On the central levels problem
The central levels problem asserts that the subgraph of the (2m+1)dimen...
read it

Combinatorial generation via permutation languages. I. Fundamentals
In this work we present a general and versatile algorithmic framework fo...
read it

Flip distances between graph orientations
Flip graphs are a ubiquitous class of graphs, which encode relations ind...
read it

On orthogonal symmetric chain decompositions
The ncube is the poset obtained by ordering all subsets of {1,...,n} by...
read it

On Lshaped Point Set Embeddings of Trees: First Nonembeddable Examples
An Lshaped embedding of a tree in a point set is a planar drawing of th...
read it

Realization of shift graphs as disjointness graphs of 1intersecting curves in the plane
It is shown that shift graphs can be realized as disjointness graphs of ...
read it

Gray codes and symmetric chains
We consider the problem of constructing a cyclic listing of all bitstrin...
read it

Sparse Kneser graphs are Hamiltonian
For integers k≥ 1 and n≥ 2k+1, the Kneser graph K(n,k) is the graph whos...
read it

A short proof of the middle levels theorem
Consider the graph that has as vertices all bitstrings of length 2n+1 wi...
read it
Torsten Mütze
is this you? claim profile