Matching graphs of hypercubes and complete bipartite graphs

DOI10.1016/J.EJC.2009.03.007MaRDI QIDQ1039435zbMATH OpenOpenAlexFDO

Authors Jiří Fink

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

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

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

Cites work

• 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
• scientific article; zbMATH DE number 2176112 (Why is no real title available?)
• scientific article; zbMATH DE number 888853 (Why is no real title available?)
• 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

Cited in

(23)

• 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
• Towards a problem of Ruskey and Savage on matching extendability
• Matchings extend to Hamiltonian cycles in 5-cube
• Matching transformation graphs of cubic bipartite plane graphs
• A note on equitable Hamiltonian cycles
• Higher matching complexes of complete graphs and complete bipartite graphs
• Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes
• Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle
• Matching critical intersection hypergraphs
• Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
• Matching graphs of Hypercubes and Complete Bipartite Graphs
• Connectivity of matching graph of hypercube
• Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
• Extensions to 2-factors in bipartite graphs
• On the k-matchings of the complements of bicyclic graphs
• Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs
• Small matchings extend to Hamiltonian cycles in hypercubes
• Perfect matching complexes of honeycomb graphs
• Almost fair perfect matchings in complete bipartite graphs
• A kind of matchings extend to Hamiltonian cycles in hypercubes
• Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges
• The clique complex and hypergraph matching

This page was built for publication: Matching graphs of hypercubes and complete bipartite graphs

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