Perfect matchings extend to Hamilton cycles in hypercubes

From MaRDI portal
Publication:2384812

DOI10.1016/j.jctb.2007.02.007zbMath1126.05080OpenAlexW2088131503WikidataQ56001801 ScholiaQ56001801MaRDI QIDQ2384812

Jiří Fink

Publication date: 10 October 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2007.02.007




Related Items (36)

Combining SAT solvers with computer algebra systems to verify combinatorial conjecturesPerfect matchings extend to two or more Hamiltonian cycles in hypercubesA type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubesMathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT SolversOn the path separation number of graphsExtending perfect matchings to Gray codes with prescribed endsAccordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulantsMatchings extend to Hamiltonian cycles in hypercubes with faulty edgesPrescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edgesExtensions to 2-factors in bipartite graphsTwo algorithms extending a perfect matching of the hypercube into a Hamiltonian cycleMatching graphs of Hypercubes and Complete Bipartite GraphsHamiltonian fault-tolerance of hypercubesTowards a problem of Ruskey and Savage on matching extendabilityMatchings extend to Hamiltonian cycles in 5-cubeOn the central levels problemOne-to-one disjoint path covers on \(k\)-ary \(n\)-cubesBetwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphsBounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubesThe Kirchhoff index of folded hypercubes and some variant networksOn the mutually independent Hamiltonian cycles in faulty hypercubesSome properties on Estrada index of folded hypercubes networksExtending perfect matchings to Hamiltonian cycles in line graphsPerfect matchings and Hamiltonicity in the Cartesian product of cyclesA note on equitable Hamiltonian cyclesNearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizationsUnpaired many-to-many vertex-disjoint path covers of a class of bipartite graphsHow many circuits determine an oriented matroid?Small matchings extend to Hamiltonian cycles in hypercubesThe SAT+CAS method for combinatorial search with applications to best matrices2-Factors Without Close Edges in the n-Dimensional CubePerfect matchings extending on subcubes to Hamiltonian cycles of hypercubesThe Kirchhoff index of hypercubes and related complex networksMatching graphs of hypercubes and complete bipartite graphsUpper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube networkCounting Hamiltonian cycles in bipartite graphs



Cites Work


This page was built for publication: Perfect matchings extend to Hamilton cycles in hypercubes