Gray codes extending quadratic matchings

DOI10.1002/JGT.22371zbMath1466.05178OpenAlexW2810992636WikidataQ129605258 ScholiaQ129605258MaRDI QIDQ4995564

Tomáš Dvořák, Jiří Fink

Publication date: 25 June 2021

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22371

zbMATH Keywords

hypercubematchingHamilton cycleGray codeRuskey and Savage problem

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Extending perfect matchings to Gray codes with prescribed ends ⋮ Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle

This page was built for publication: Gray codes extending quadratic matchings