scientific article; zbMATH DE number 888853
From MaRDI portal
Publication:4881930
zbMath0855.05089MaRDI QIDQ4881930
Publication date: 13 June 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (19)
Perfect matchings extend to two or more Hamiltonian cycles in hypercubes ⋮ A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes ⋮ Perfect matchings extend to Hamilton cycles in hypercubes ⋮ Extending perfect matchings to Gray codes with prescribed ends ⋮ Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ Extensions to 2-factors in bipartite graphs ⋮ Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle ⋮ Matching graphs of Hypercubes and Complete Bipartite Graphs ⋮ Hamiltonian fault-tolerance of hypercubes ⋮ Towards a problem of Ruskey and Savage on matching extendability ⋮ Matchings extend to Hamiltonian cycles in 5-cube ⋮ Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs ⋮ On the mutually independent Hamiltonian cycles in faulty hypercubes ⋮ Extending perfect matchings to Hamiltonian cycles in line graphs ⋮ A note on equitable Hamiltonian cycles ⋮ Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations ⋮ Small matchings extend to Hamiltonian cycles in hypercubes ⋮ Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes ⋮ Matching graphs of hypercubes and complete bipartite graphs
This page was built for publication:
