The following pages link to Torsten Mütze (Q299828):
Displaying 50 items.
- Scheduling with few changes (Q299829) (← links)
- On globally sparse Ramsey graphs (Q393934) (← links)
- Construction of 2-factors in the middle layer of the discrete cube (Q444915) (← links)
- Small subgraphs in random graphs and the power of multiple choices (Q536648) (← links)
- On the path-avoidance vertex-coloring game (Q640416) (← links)
- On universal partial words (Q1689916) (← links)
- Trimming and gluing Gray codes (Q1694730) (← links)
- On L-shaped point set embeddings of trees: first non-embeddable examples (Q1725769) (← links)
- An algorithmic framework for tool switching problems with multiple objectives (Q1751917) (← links)
- Combinatorial generation via permutation languages. II. Lattice congruences (Q2055278) (← links)
- Gray codes and symmetric chains (Q2072179) (← links)
- A constant-time algorithm for middle levels Gray codes (Q2309469) (← links)
- On orthogonal symmetric chain decompositions (Q2325764) (← links)
- Generalized switch-setting problems (Q2461202) (← links)
- On the central levels problem (Q2692785) (← links)
- Proof of the middle levels conjecture (Q2809275) (← links)
- (Q2857423) (← links)
- On antimagic directed graphs (Q3055919) (← links)
- Efficient Computation of Middle Levels Gray Codes (Q3452851) (← links)
- Efficient Computation of Middle Levels Gray Codes (Q4554342) (← links)
- On universal partial words (Q4558959) (← links)
- A constant-time algorithm for middle levels Gray codes (Q4575895) (← links)
- (Q4636639) (← links)
- A short proof of the middle levels theorem (Q4645033) (← links)
- Probabilistic One-Player Ramsey Games via Deterministic Two-Player Games (Q4899043) (← links)
- Distance-Preserving Graph Contractions (Q4993321) (← links)
- (Q5002744) (← links)
- Sparse Kneser graphs are Hamiltonian (Q5006324) (← links)
- On a Combinatorial Generation Problem of Knuth (Q5080484) (← links)
- Rainbow Cycles in Flip Graphs. (Q5115806) (← links)
- On L-shaped point set embeddings of trees: first non-embeddable examples (Q5119383) (← links)
- Combinatorial generation via permutation languages (Q5146846) (← links)
- Rainbow Cycles in Flip Graphs (Q5208641) (← links)
- Sparse Kneser graphs are Hamiltonian (Q5230348) (← links)
- Distance-Preserving Graph Contractions (Q5233754) (← links)
- (Q5365033) (← links)
- Coloring random graphs online without creating monochromatic subgraphs (Q5495876) (← links)
- Combinatorial generation via permutation languages. I. Fundamentals (Q5863047) (← links)
- Bipartite Kneser graphs are Hamiltonian (Q5890906) (← links)
- Bipartite Kneser graphs are Hamiltonian (Q5895045) (← links)
- A minimum-change version of the Chung-Feller theorem for Dyck paths (Q5915781) (← links)
- On flips in planar matchings (Q5918594) (← links)
- On flips in planar matchings (Q5919054) (← links)
- Flip distances between graph orientations (Q5919075) (← links)
- Flip distances between graph orientations (Q5919466) (← links)
- A minimum-change version of the Chung-Feller theorem for Dyck paths (Q5970257) (← links)
- Star transposition Gray codes for multiset permutations (Q6074576) (← links)
- A book proof of the middle levels theorem (Q6126419) (← links)
- Combinatorial generation via permutation languages. III: Rectangulations (Q6156087) (← links)
- Combinatorial Generation via Permutation Languages. V. Acyclic Orientations (Q6170445) (← links)
