Hamiltonian intervals in the lattice of binary paths

DOI10.37236/12144OpenAlexW4391692844WikidataQ128223476 ScholiaQ128223476MaRDI QIDQ6197814

Ioannis Tasoulas, Kostas Manes, Aristidis Sapounakis

Publication date: 19 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/12144

zbMATH Keywords

geometric representation of pathsnatural partial ordering

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some applications of algebra to combinatorics
• Counting pairs of noncrossing binary paths: a bijective approach
• On the existence of Hamiltonian paths in the cover graph of \(M\)(\(n\))
• Lattices of lattice paths
• Some Hamilton Paths and a Minimal Change Algorithm
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• Chains with Small Intervals in the Lattice of Binary Paths
• Combinatorial Gray codes -- an updated survey

This page was built for publication: Hamiltonian intervals in the lattice of binary paths