Torsten Mütze

collaborators

3 papers

math.CO2025

Matchings in hypercubes extend to long cycles

JiÅÃ Fink, Torsten MÃ¼tze

The $d$ -dimensional hypercube graph $Q_{d}$ has as vertices all subsets of ${1, \dots, d}$ , and an edge between any two sets that differ in a single element. The Ruskey-Savage conje…

math.CO2025

Flips in colorful triangulations

Rohan Acharya, Torsten MÃ¼tze, Francesco Verciani

The associahedron is the graph $G_{N}$ that has as nodes all triangulations of a convex $N$ -gon, and an edge between any two triangulations that differ in a flip operation.…

cs.DM2024

Listing spanning trees of outerplanar graphs by pivot-exchanges

Nastaran Behrooznia, Torsten MÃ¼tze

We prove that the spanning trees of any outerplanar triangulation $G$ can be listed so that any two consecutive spanning trees differ in an exchange of two edges that share an end…