A numeral system for the middle-levels graphs

DOI10.5614/ejgta.2021.9.1.13zbMath1468.05191OpenAlexW3159618358MaRDI QIDQ4958054

Italo Jose Dejter

Publication date: 6 September 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2021.9.1.13

zbMATH Keywords

Boolean latticeHasse diagramnumeral systemcomplemented reversalmiddle-levels graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Total orders (06A05) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62)

Uses Software

• FXT
• hfloat
• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two Hamilton cycles in bipartite reflective Kneser graphs
• Explicit matchings in the middle levels of the Boolean lattice
• A constant-time algorithm for middle levels Gray codes
• Proof of the middle levels conjecture
• Efficient Computation of Middle Levels Gray Codes
• A short proof of the middle levels theorem
• Matters Computational
• On Middle Cube Graphs
• Graphs, friends and acquaintances
• Sparse Kneser graphs are Hamiltonian

This page was built for publication: A numeral system for the middle-levels graphs