Torsten Mütze

activity

20092026

most citedProof of the middle levels conjecture

60 citations · 165 across the 31 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

math.CO2021

Star transposition Gray codes for multiset permutations

Petr Gregor, Arturo Merino, Torsten Mütze

Given integers $k \geq 2$ and $a_{1}, \dots, a_{k} \geq 1$ , let $a := (a_{1}, \dots, a_{k})$ and $n := a_{1} + \dots + a_{k}$ . An $a$ -multiset permutation is a string of length…

cs.DM2021★ 2 cited

Combinatorial generation via permutation languages. IV. Elimination trees

Jean Cardinal, Arturo Merino, Torsten Mütze

An elimination tree for a connected graph $G$ is a rooted tree on the vertices of $G$ obtained by choosing a root $x$ and recursing on the connected components of $G - x$ to produce…

math.CO2021

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…