Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations (revised) (original) (raw)
Related papers
Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations
2009
2014
Hamiltonicity of hypercubes with a constraint of required and faulty edges
Journal of Combinatorial Optimization, 2007
Regular connected bipancyclic spanning subgraphs of hypercubes
Computers & Mathematics with Applications, 2011
Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
Discrete Applied Mathematics, 2019
A survey of the theory of hypercube graphs
Computers & Mathematics With Applications, 1988
Extending a perfect matching to a Hamiltonian cycle
Discrete Mathematics & Theoretical Computer Science, 2015
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges
Inf. Process. Lett., 2021
Hamiltonicity and combinatorial polyhedra
Journal of Combinatorial Theory, Series B, 1981
Hamilton Decompositions and (n/2)-Factorizations of Hypercubes
Journal of Graph Algorithms and Applications, 2003
Degree Conditions for Matchability in 3-Partite Hypergraphs
Journal of Graph Theory, 2017
Another characterization of hypercubes
Discrete Mathematics, 1982
Counting and packing Hamilton ell\ellell-cycles in dense hypergraphs
Journal of Combinatorics, 2016
N-dimensional Boolean hypercubes and the goldbach conjecture
Journal of Mathematical Chemistry, 2016
Hamiltonian cycles in hypercubes with faulty edges
Information Sciences an International Journal, 2014
On the spanning trees of the hypercube and other products of graphs
arXiv (Cornell University), 2012
The size of a hypergraph and its matching number
2011
Hamiltonian paths in hypercubes with local traps
Information Sciences, 2017
The de Bruijn-Erdos Theorem for hypergraphs
2010
Minimum degree thresholds for Hamilton (k/2)-cycles in k-uniform hypergraphs
Journal of Combinatorial Theory, Series B, 2022
The matching number and Hamiltonicity of graphs
AKCE International Journal of Graphs and Combinatorics
On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching
Arxiv preprint arXiv:1104.3158, 2011
Discrete Applied Mathematics
SIAM Journal on Discrete Mathematics, 2005
Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
Information Processing Letters - IPL, 2008
Information Sciences, 2013
Packing tight Hamilton cycles in uniform hypergraphs
Arxiv preprint arXiv:1102.1488, 2011
Perfect Matchings in Balanced Hypergraphs
Combinatorica, 1996
Long path and cycle decompositions of even hypercubes
European Journal of Combinatorics