60 citations · 165 across the 31 of their papers we have counts for
4 papers · 1 filter
Rainbow cycles in flip graphs
Stefan Felsner, Linda Kleist, Torsten Mütze +1
The flip graph of triangulations has as vertices all triangulations of a convex -gon, and an edge between any two triangulations that differ in exactly one edge. An -rainbow…
Sparse Kneser graphs are Hamiltonian
Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak
For integers and , the Kneser graph is the graph whose vertices are the -element subsets of and whose edges connect pairs of subs…
A short proof of the middle levels theorem
Petr Gregor, Torsten Mütze, Jerri Nummenpalo
Consider the graph that has as vertices all bitstrings of length with exactly or entries equal to 1, and an edge between any two bitstrings that differ in exactly…
Distance-preserving graph contractions
Aaron Bernstein, Karl Däubel, Yann Disser +3
Compression and sparsification algorithms are frequently applied in a preprocessing step before analyzing or optimizing large networks/graphs. In this paper we propose and study a…