Colorings of diagrams of interval orders and \(\alpha\)-sequences of sets

DOI10.1016/0012-365X(94)00283-OzbMath0837.05064MaRDI QIDQ1898340

Stefan Felsner, William T. jun. Trotter

Publication date: 13 May 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

diagramBoolean latticeinterval orderchromatic numbercoloringHamiltonian pathcolorslong cycles\(\alpha\)-sequences

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99) Eulerian and Hamiltonian graphs (05C45)

Related Items (14)

Efficient Computation of Middle Levels Gray Codes ⋮ The first three levels of an order preserving Hamiltonian path in the subset lattice ⋮ On a Combinatorial Generation Problem of Knuth ⋮ Long cycles in the middle two layers of the discrete cube ⋮ Trimming and gluing Gray codes ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ Hamiltonian cycles and symmetric chains in Boolean lattices. ⋮ A short proof of the middle levels theorem ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ Incidence posets and cover graphs ⋮ Proof of the middle levels conjecture ⋮ A constant-time algorithm for middle levels Gray codes ⋮ An update on the middle levels problem

Cites Work

• Explicit matchings in the middle levels of the Boolean lattice
• Unnamed Item

This page was built for publication: Colorings of diagrams of interval orders and \(\alpha\)-sequences of sets