Matching graphs of hypercubes and complete bipartite graphs
type: Item
instance of: scholarly article
title: Matching graphs of hypercubes and complete bipartite graphs
zbMATH Open document ID: 1218.05128
author: Jiří Fink
published in: European Journal of Combinatorics
publication date: 2009-11-30T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5640342
MaRDI profile type: Publication
full work available at URL: j.ejc.2009.03.007
OpenAlex ID: W2011977293
cites work: Hamiltonian Cycles with Prescribed Edges in Hypercubes
cites work: Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations
cites work: Perfect matchings extend to Hamilton cycles in hypercubes
cites work: Q4681162
cites work: Q4881930
cites work: Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
cites work: A Survey of Combinatorial Gray Codes
cites work: Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
DOI: 10.1016/J.EJC.2009.03.007
description: scientific article; zbMATH DE number 5640342