Classification of the Hamiltonian cycles in binary hypercubes

DOI10.1023/A:1010257922257zbMath1067.68105OpenAlexW97300732MaRDI QIDQ1778472

P. P. Parkhomenko

Publication date: 17 June 2005

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1010257922257

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Modifying the tolerant substitution method in almost uniform compact surveys ⋮ On the spectrum of Hamiltonian cycles in the \(n\)-cube ⋮ Shaped lattice graphs as models of the multiprocessor computer systems ⋮ Construction of maximum cycles in faulty binary hypercubes ⋮ Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)

This page was built for publication: Classification of the Hamiltonian cycles in binary hypercubes