scientific article
From MaRDI portal
Publication:3309859
zbMath0528.05030MaRDI QIDQ3309859
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
Total \([1,2\)-domination in graphs] ⋮ A note on the middle levels problem ⋮ Efficient Computation of Middle Levels Gray Codes ⋮ On a Combinatorial Generation Problem of Knuth ⋮ Long cycles in the middle two layers of the discrete cube ⋮ The \(q\)-analog of the middle levels problem ⋮ \([1,2\)-domination in graphs] ⋮ Star transposition Gray codes for multiset permutations ⋮ The automorphism group of the bipartite Kneser graph ⋮ Trimming and gluing Gray codes ⋮ On the central levels problem ⋮ Triangle-free Hamiltonian Kneser graphs ⋮ Construction of 2-factors in the middle layer of the discrete cube ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ A short proof of the middle levels theorem ⋮ Cycle-regular graphs of \((0,\lambda )\)-graph type ⋮ The prism over the middle-levels graph is Hamiltonian ⋮ Cayley properties of the line graphs induced by consecutive layers of the hypercube ⋮ On generalized middle-level problem ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ A constant-time algorithm for middle levels Gray codes ⋮ Boolean layer cakes ⋮ Kneser graphs are Hamiltonian for \(n\geq 3k\) ⋮ The antipodal layers problem
This page was built for publication:
