Towards a classification of Hamiltonian cycles in the 6-cube

MaRDI QIDQ3515554zbMATH OpenFDO

Authors Yury Chebiryak, Daniel Kroening

Publication date 29 July 2008

zbMATH Keywords

Gray codecode equivalencebitonic sorting network

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Recommendations

• Classification of the Hamiltonian cycles in binary hypercubes
• scientific article; zbMATH DE number 790411
• Counting Hamiltonian cycles in bipartite graphs
• scientific article; zbMATH DE number 5239125
• On automorphisms of cycles in an n-dimensional Boolean cube

Cited in

(12)

• The maximum length of circuit codes with long bit runs and a new characterization theorem
• Finding Lean Induced Cycles in Binary Hypercubes
• Isomorphism of maximum length circuit codes
• Classification of the Hamiltonian cycles in binary hypercubes
• On the spectrum of Hamiltonian cycles in the \(n\)-cube
• Hamilton paths and cycles in vertex-transitive graphs of order 6p
• The special cuts of the \(600\)-cell
• Counting Hamiltonian cycles in bipartite graphs
• Snakes, coils, and single-track circuit codes with spread \(k\)
• On locally balanced Gray codes
• scientific article; zbMATH DE number 5239125 (Why is no real title available?)
• All the facets of the six-point Hamming cone

Describes a project that uses

Uses Software

• MiniSat

This page was built for publication: Towards a classification of Hamiltonian cycles in the 6-cube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3515554)