Hamiltonian circuits and paths in subset graphs with circular adjacency

DOI10.1016/0012-365X(93)90292-2zbMath0831.05041OpenAlexW1996705597MaRDI QIDQ1313856

T. C. Enns

Publication date: 23 January 1996

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90292-2

zbMATH Keywords

Hamiltonian circuitHamiltonian pathGray codes

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial codes (94B25) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Gray codes in graphs of subsets

This page was built for publication: Hamiltonian circuits and paths in subset graphs with circular adjacency