Degree conditions for hamiltonicity : Counting the number of missing edgesFAUDREE, Ralph J; SCHELP, Richard H; SAITO, Akira et al.Discrete mathematics. 2007, Vol 307, Num 7-8, pp 873-877, issn 0012-365X, 5 p.Conference Paper

On the maximum number of cycles in a Hamiltonian graphRAUTENBACH, Dieter; STELLA, Irene.Discrete mathematics. 2005, Vol 304, Num 1-3, pp 101-107, issn 0012-365X, 7 p.Article

SC-HAMILTONICITY AND ITS LINKAGES WITH STRONG HAMILTONICITY OF A GRAPHBENVENUTI, Daniel K; PUNNEN, Abraham P.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 4, pp 2035-2041, issn 0895-4801, 7 p.Article

Hamiltonian path graphsCHARTRAND, G; KAPOOR, S. F; NORDHAUS, E. A et al.Journal of graph theory. 1983, Vol 7, Num 4, pp 419-427, issn 0364-9024Article

How many random eges make a graph Hamiltonian?ELI SHAMIR.Combinatorica (Print). 1983, Vol 3, Num 1, pp 123-131, issn 0209-9683Article

Hamiltonian results in K_1,3-free graphsMATTHEWS, M. M; SUMNER, D. P.Journal of graph theory. 1984, Vol 8, Num 1, pp 139-146, issn 0364-9024Article

Hamiltonicity in (0-1)-polyhedraNADDEF, D. J; PULLEYBLANK, W. R.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 1, pp 41-52, issn 0095-8956Article

One Hamiltonian line graphsCLARK, L.Journal of graph theory. 1984, Vol 8, Num 2, pp 303-307, issn 0364-9024Article

New sufficient conditions for cycles in graphsGENG-HUA FAN.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 3, pp 221-227, issn 0095-8956Article

Hamiltonian pancyclic graphsAMAR, D; FLANDRIN, E; FOURNIER, I et al.Discrete mathematics. 1983, Vol 46, Num 3, issn 0012-365X, 327Article

Are all simple 4-polytopes hamiltonian?ROSENFELD, M.Israel Journal of Mathematics. 1983, Vol 46, Num 3, pp 161-169, issn 0021-2172Article

An O(n + m) Certifying Triconnnectivity Algorithm for Hamiltonian GraphsELMASRY, Amr; MEHLHORN, Kurt; SCHMIDT, Jens M et al.Algorithmica. 2012, Vol 62, Num 3-4, pp 754-766, issn 0178-4617, 13 p.Article

Generalized knight's tour on 3D chessboardsSEN BAI; YANG, Xiao-Fan; ZHU, Gui-Bin et al.Discrete applied mathematics. 2010, Vol 158, Num 16, pp 1727-1731, issn 0166-218X, 5 p.Article

Generalized knight's tours on rectangular chessboardsCHIA, G. L; ONG, Siew-Hui.Discrete applied mathematics. 2005, Vol 150, Num 1-3, pp 80-98, issn 0166-218X, 19 p.Article

A generalization of Dirac's theorem on cycles through k vertices in k-connected graphsFLANDRIN, Evelyne; HAO LI; MARCZYK, Antoni et al.Discrete mathematics. 2007, Vol 307, Num 7-8, pp 878-884, issn 0012-365X, 7 p.Conference Paper

A generalization of a result of Häggkvist and NicoghossianBAUER, D; BROERSMA, H. J; VELDMAN, H. J et al.Journal of combinatorial theory. Series B. 1989, Vol 47, Num 2, pp 237-243, issn 0095-8956, 7 p.Article

Graphs uniquely Hamiltonian-connected from a vertexHENDRY, G. R. T.Discrete mathematics. 1984, Vol 49, Num 1, pp 61-74, issn 0012-365XArticle

Hamiltonian decompositions of complete graphsHILTON, A. J. W.Journal of combinatorial theory. Series B. 1984, Vol 36, Num 2, pp 125-134, issn 0095-8956Article

Powers of connected graphs and hamiltonicityPAOLI, M.Discrete mathematics. 1984, Vol 52, Num 1, pp 91-99, issn 0012-365XArticle

On hamiltonian-connected regular graphsTOMESCU, I.Journal of graph theory. 1983, Vol 7, Num 4, pp 429-436, issn 0364-9024Article

Hamiltonian uniform subset graphsBOR-LIANG CHEN; KO-WEI LIH.Journal of combinatorial theory. Series B. 1987, Vol 42, Num 3, pp 257-263, issn 0095-8956Article

Forbidden subgraphs and Hamiltonian properties in the square of a connected graphGOULD, R. J; JACOBSON, M. S.Journal of graph theory. 1984, Vol 8, Num 1, pp 147-154, issn 0364-9024Article

Hamiltonian cycles in striped graphs: the two-stripe problemGARFINKEL, R. S; SUNDARARAGHAVAN, P. S.SIAM journal on algebraic and discrete methods. 1984, Vol 5, Num 4, pp 463-466, issn 0196-5212Article

On the notion of infinite hamiltonian graphHALIN, R.Journal of graph theory. 1983, Vol 7, Num 4, pp 437-440, issn 0364-9024Article

The classification of hamiltonian generalized petersen graphsALSPACH, B.Journal of combinatorial theory. Series B. 1983, Vol 34, Num 3, pp 293-312, issn 0095-8956Article