JSAT
2008
13 years 4 months ago
2008
In this paper, we consider the problem of classifying Hamiltonian cycles in a binary hypercube. Previous work proposed a classification of these cycles using the edge representati...
DM
2008
13 years 4 months ago
2008
Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting primitively on the set of vertices. If F consists of Hamiltonian cycles, then F is the...
DM
2010
13 years 4 months ago
2010
Using a generalisation of Hamiltonian cycles to uniform hypergraphs due to Katona and Kierstead, we define a new notion of a Hamiltonian decomposition of a uniform hypergraph. We ...
LATIN
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
COCOON
2007
Springer
13 years 10 months ago
2007
Springer
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...