scientific article; zbMATH DE number 7375993
From MaRDI portal
Publication:5002744
DOI10.4230/LIPIcs.ICALP.2018.66zbMath1499.05341MaRDI QIDQ5002744
Petr Gregor, Kaja Wille, Joe Sawada, Sven Jäger, Torsten Mütze
Publication date: 28 July 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Partial orders, general (06A06) Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05) Linear codes (general theory) (94B05) Combinatorial codes (94B25) Eulerian and Hamiltonian graphs (05C45)
Related Items (3)
Explicit \(\Delta \)-edge-coloring of consecutive levels in a divisor lattice ⋮ Orthogonal Symmetric Chain Decompositions of Hypercubes ⋮ Gray codes and symmetric chains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamiltonian cycles and symmetric chains in Boolean lattices.
- An inductive construction for Hamilton cycles in Kneser graphs
- A construction of Gray codes inducing complete graphs
- On generalized middle-level problem
- Universal cycles for permutations
- Explicit matchings in the middle levels of the Boolean lattice
- Strong versions of Sperner's theorem
- Recursive matching algorithms and linear orders on the subset lattice
- Binary Gray codes with long bit runs
- Venn diagrams and symmetric chain decompositions in the Boolean lattice
- On edge decompositions of posets
- Trimming and gluing Gray codes
- Shorthand universal cycles for permutations
- Linear time construction of a compressed Gray code
- Monotone Gray codes and the middle levels problem
- Transition restricted Gray codes
- Lexicographic matching in Boolean algebras
- Proof of the middle levels conjecture
- Perfect Snake-in-the-Box Codes for Rank Modulation
- Probabilities of Independent Choices Being Ordered
- A Survey of Combinatorial Gray Codes
- A constant-time algorithm for middle levels Gray codes
- A short proof of the middle levels theorem
This page was built for publication:
