Extending perfect matchings to Gray codes with prescribed ends

zbMath1391.05145MaRDI QIDQ1648667

Petr Gregor, Riste Škrekovski, Tomáš Novotný

Publication date: 27 June 2018

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

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i2p56

zbMATH Keywords

hypercubeHamiltonian pathperfect matchinggray code

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Paths and cycles (05C38) Combinatorial codes (94B25) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle ⋮ Hypothesis-checker

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
• Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
• Hamiltonian paths with prescribed edges in hypercubes
• Perfect matchings extend to Hamilton cycles in hypercubes
• Matchings extend into 2-factors in hypercubes
• Proof of the middle levels conjecture
• Hamiltonian fault-tolerance of hypercubes
• Matching Extendability in Hypercubes
• A Survey of Combinatorial Gray Codes
• Gray codes extending quadratic matchings
• Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
• Hamiltonian Cycles with Prescribed Edges in Hypercubes

This page was built for publication: Extending perfect matchings to Gray codes with prescribed ends