scientific article; zbMATH DE number 1156633

zbMATH Open0901.05056MaRDI QIDQ4390664FDOQ4390664

Authors: John C. George, Thom Porter, Lane Clark 

Publication date: 26 November 1998

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

cube1-factors

Mathematics Subject Classification ID

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

Cited In (7)

• Semi-perfect 1-factorizations of the hypercube
• Title not available (Why is that?)
• Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations
• Convergence of graphs with intermediate density
• Complexes of discrete Morse functions
• Exact Ramsey numbers of odd cycles via nonlinear optimisation
• Enumerating perfect matchings in \(n\)-cubes

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)