Connectivity of Matching Graph of Hypercube

DOI10.1137/070697288zbMath1257.05128OpenAlexW1970613007MaRDI QIDQ3563962

Jiří Fink

Publication date: 1 June 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/070697288

zbMATH Keywords

hypercubeHamiltonian cycleperfect matching

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

Combining SAT solvers with computer algebra systems to verify combinatorial conjectures ⋮ Perfect matchings extend to two or more Hamiltonian cycles in hypercubes ⋮ MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers ⋮ Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle ⋮ Matching graphs of Hypercubes and Complete Bipartite Graphs ⋮ Matchings extend to Hamiltonian cycles in 5-cube ⋮ Small matchings extend to Hamiltonian cycles in hypercubes

This page was built for publication: Connectivity of Matching Graph of Hypercube