Extending pairings to Hamiltonian cycles

MaRDI QIDQ890801zbMATH OpenFDO

Authors Dmitry G. Fon-Der-Flaass

Publication date 16 November 2015

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL http://semr.math.nsc.ru/v7/p115-118.pdf

zbMATH Keywords

hypercubeHamiltonian cycle1-factorKreweras conjecture

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Small matchings extend to Hamiltonian cycles in hypercubes
• Two types of matchings extend to Hamiltonian cycles in hypercubes.
• Matchings of quadratic size extend to long cycles in hypercubes
• Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
• Perfect matchings extend to two or more Hamiltonian cycles in hypercubes

Cited in

(3)

• Extending cycles locally to Hamilton cycles
• Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle
• 2-Factors without close edges in the \(n\)-dimensional cube

This page was built for publication: Extending pairings to Hamiltonian cycles

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