scientific article; zbMATH DE number 1156633

MaRDI QIDQ4390664zbMATH OpenFDO

Authors John C. George, Thom Porter, Lane Clark

Publication date 26 November 1998

zbMATH Keywords

1-factorscube

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Enumerating perfect matchings in n-cubes
• Counting 1-factors in regular bipartite graphs
• The number of perfect matchings in a hypercube
• On the numbers of 1-factors and 1-factorizations of hypergraphs

Cited in

(7)

• Semi-perfect 1-factorizations of the hypercube
• Exact Ramsey numbers of odd cycles via nonlinear optimisation
• Complexes of discrete Morse functions
• Enumerating perfect matchings in n-cubes
• Convergence of graphs with intermediate density
• scientific article; zbMATH DE number 1868913 (Why is no real title available?)
• Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations

This page was built for publication:

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