Connectivity of matching graph of hypercube

DOI10.1137/070697288MaRDI QIDQ3563962zbMATH OpenOpenAlexFDO

Authors 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

Hamiltonian cyclehypercubeperfect matching

Mathematics Subject Classification ID

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

Recommendations

• Matching graphs of Hypercubes and Complete Bipartite Graphs
• Matching graphs of hypercubes and complete bipartite graphs
• Perfect matchings extend to Hamilton cycles in hypercubes
• scientific article; zbMATH DE number 888853
• Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes

Cited in

(11)

• Matching graphs of hypercubes and complete bipartite graphs
• Perfect matchings extend to two or more Hamiltonian cycles in hypercubes
• Matchings extend to Hamiltonian cycles in 5-cube
• On the conjecture of bijection between perfect matching and sub-hypercube in folded hypercubes
• Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle
• Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
• MathCheck: a math assistant via a combination of computer algebra systems and SAT solvers
• Matching graphs of Hypercubes and Complete Bipartite Graphs
• Connectivity of the k-Out Hypercube
• Small matchings extend to Hamiltonian cycles in hypercubes
• Hamiltonian paths passing through linear forests in hypercubes with faulty edges

This page was built for publication: Connectivity of matching graph of hypercube

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