Minimal enumerations of subsets of a finite set and the middle level problemEVDOKIMOV, A. A; PEREZHOGIN, A. L.Discrete applied mathematics. 2001, Vol 114, Num 1-3, pp 109-114, issn 0166-218XArticle

On the number of Hamiltonian cycles in triangulationsKRATOCHVIL, J; ZEPS, D.Journal of graph theory. 1988, Vol 12, Num 2, pp 191-194, issn 0364-9024Article

On the number of Hamilton cycles in a random graphCOOPER, C; FRIEZE, A. M.Journal of graph theory. 1989, Vol 13, Num 6, pp 719-735, issn 0364-9024, 17 p.Article

Dénombrement des cycles hamiltoniens dans un rectangle quadrillé = Enumeration of Hamiltonian cycles in a rectangle made of squaresKREWERAS, G.European journal of combinatorics. 1992, Vol 13, Num 6, pp 473-476, issn 0195-6698Article

The square of a Hamiltonian cycleGENGHUA FAN; HäGGKVIST, R.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 2, pp 203-212, issn 0895-4801Article

Hamiltonian cycles in 3-connected claw-free graphsMINGCHU LI.Journal of graph theory. 1993, Vol 17, Num 3, pp 303-313, issn 0364-9024Article

Hamilton cycles and closed trails in iterated line graphsCATLIN, P. A; JANAKIRAMAN, I. T. N; SRINIVASAN, N et al.Journal of graph theory. 1990, Vol 14, Num 3, pp 347-364, issn 0364-9024Article

Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubesGREGOR, Petr.Discrete mathematics. 2009, Vol 309, Num 6, pp 1711-1713, issn 0012-365X, 3 p.Article

How to tile by dominoes the boundary of a polycubeBODINI, Olivier; LEFRANC, Sandrine.Lecture notes in computer science. 2006, pp 630-638, issn 0302-9743, isbn 3-540-47651-2, 1Vol, 9 p.Conference Paper

A Gray code for necklaces of fixed densityMIN YIH WANG, T; SAVAGE, C. D.SIAM journal on discrete mathematics (Print). 1996, Vol 9, Num 4, pp 654-673, issn 0895-4801Article

Théorie des Graphes: Cycles Hamiltoniens, coloration d'arêtes et problèmes de pavages = Graph Theory: Hamilton Cycles, Edge Colorings and Tiling ProblemsJurkiewicz, Samuel; Fournier, J.-C.1996, 140 p.Thesis

Polynomial algorithms for hamiltonian cycle in cocomparability graphsDEOGUN, J. S; STEINER, G.SIAM journal on computing (Print). 1994, Vol 23, Num 3, pp 520-552, issn 0097-5397Article

Graphs with every matching contained in a cycleABDELHAMID BENHOCINE; PAWEL WOJDA, A.Discrete mathematics. 1993, Vol 118, Num 1-3, pp 11-21, issn 0012-365XArticle

Applying a condition for a hamiltonian bipartite graph to be bipancyclicAMAR, D.Discrete mathematics. 1993, Vol 111, Num 1-3, pp 19-25, issn 0012-365XConference Paper

A linear-time algorithm for finding Hamiltonian cycles in tournamentsMANOUSSAKIS, Y.Discrete applied mathematics. 1992, Vol 36, Num 2, pp 199-201, issn 0166-218XArticle

Connectivity of consecutive-d digraphsDU, D.-Z; HSU, D. F; PECK, G. W et al.Discrete applied mathematics. 1992, Vol 37-38, pp 169-177, issn 0166-218XArticle

A new look at the de Bruijn graphFREDRICKSEN, H.Discrete applied mathematics. 1992, Vol 37-38, pp 193-203, issn 0166-218XArticle

Enumeration of Hamiltonian cycles in certain generalized Petersen graphsSCHWENK, A. J.Journal of combinatorial theory. Series B. 1989, Vol 47, Num 1, pp 53-59, issn 0095-8956Article

A note on the computation of the k-closure of a graphSZWARCFITER, J. L.Information processing letters. 1987, Vol 24, Num 4, pp 279-280, issn 0020-0190Article

Hamiltonian threshold graphsHARARY, F; PELED, U.Discrete applied mathematics. 1987, Vol 16, Num 1, pp 11-15, issn 0166-218XArticle

When the cartesian product of two directed cycles is hyperhamiltonianGALLIAN, J. A; WITTE, D.Journal of graph theory. 1987, Vol 11, Num 1, pp 21-24, issn 0364-9024Article

Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-CompleteKRÜGER, Michael; HEMPEL, Harald.Lecture notes in computer science. 2006, pp 243-252, issn 0302-9743, isbn 3-540-49694-7, 1Vol, 10 p.Conference Paper

Hamilton cycles in Trivalent Cayley graphsWAGH, M. D; MO, J.Information processing letters. 1996, Vol 60, Num 4, pp 177-181, issn 0020-0190Article

An extension of the multi-path algorithm for finding hamilton cyclesKOCAY, W.Discrete mathematics. 1992, Vol 101, Num 1-3, pp 171-188, issn 0012-365XArticle

Counterexample to a conjecture on Hamilton cyclesPAULRAJA, P.Discrete mathematics. 1987, Vol 64, Num 1, issn 0012-365X, 99Article