Matching graphs of hypercubes and complete bipartite graphs
From MaRDI portal
Publication:1039435
DOI10.1016/j.ejc.2009.03.007zbMath1218.05128OpenAlexW2011977293MaRDI QIDQ1039435
Publication date: 30 November 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2009.03.007
Related Items (9)
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 ⋮ 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 ⋮ Towards a problem of Ruskey and Savage on matching extendability ⋮ Matchings extend to Hamiltonian cycles in 5-cube ⋮ A note on equitable Hamiltonian cycles ⋮ Small matchings extend to Hamiltonian cycles in hypercubes
Cites Work
- Unnamed Item
- Unnamed Item
- Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations
- Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
- Perfect matchings extend to Hamilton cycles in hypercubes
- A Survey of Combinatorial Gray Codes
- Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
This page was built for publication: Matching graphs of hypercubes and complete bipartite graphs
