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

NECESSARY AND SUFFICIENT CONDITIONS FOR UNIT GRAPHS TO BE HAMILTONIANMAIMANI, H. R; POURNAKI, M. R; YASSEMI, S et al.Pacific journal of mathematics. 2011, Vol 249, Num 2, pp 419-429, issn 0030-8730, 11 p.Article

Eigenvalues of graphs with vertices of large degree at distance three apartMOHAR, Bojan; AZHVAN SHEIKH AHMADY; RAYMAN PREET SINGH et al.Linear algebra and its applications. 2012, Vol 436, Num 11, pp 4342-4347, issn 0024-3795, 6 p.Article

On hamiltonian colorings of graphsCHARTRAND, Gary; NEBESKY, Ladislav; PING ZHANG et al.Discrete mathematics. 2005, Vol 290, Num 2-3, pp 133-143, issn 0012-365X, 11 p.Article

On s-hamiltonian-connected line graphsLAI, Hong-Jian; YANTING LIANG; YEHONG SHAO et al.Discrete mathematics. 2008, Vol 308, Num 18, pp 4293-4297, issn 0012-365X, 5 p.Article

An efficient condition for a graph to be HamiltonianSHENGJIA LI; RUIJUAN LI; JINFENG FENG et al.Discrete applied mathematics. 2007, Vol 155, Num 14, pp 1842-1845, issn 0166-218X, 4 p.Conference Paper

A Chvátal-Erdös type condition for pancyclabilityFLANDRIN, Evelyne; HAO LI; MARCZYK, Antoni et al.Discrete mathematics. 2007, Vol 307, Num 11-12, pp 1463-1466, issn 0012-365X, 4 p.Conference Paper

A degree condition implying that every matching is contained in a hamiltonian cycleAMAR, Denise; FLANDRIN, Evelyne; GANCARZEWICZ, Grzegorz et al.Discrete mathematics. 2009, Vol 309, Num 11, pp 3703-3713, issn 0012-365X, 11 p.Article

EULERIAN SUBGRAPHS CONTAINING GIVEN VERTICESZHAO ZHANG; HAO LI.SIAM journal on discrete mathematics (Print). 2011, Vol 25, Num 1-2, pp 611-621, issn 0895-4801, 11 p.Article

A census of boundary cubic rooted planar mapsWENZHONG LIU; YANPEI LIU; YAN XU et al.Discrete applied mathematics. 2007, Vol 155, Num 13, pp 1678-1688, issn 0166-218X, 11 p.Article

A short proof of Fleischner's theoremGEORGAKOPOULOS, Agelos.Discrete mathematics. 2009, Vol 309, Num 23-24, pp 6632-6634, issn 0012-365X, 3 p.Article

On spanning connected graphsLIN, Cheng-Kuan; HUANG, Hua-Min; TAN, Jimmy J. M et al.Discrete mathematics. 2008, Vol 308, Num 7, pp 1330-1333, issn 0012-365X, 4 p.Article

On the domination number of Hamiltonian graphs with minimum degree sixXING, Hua-Ming; HATTINGH, Johannes H; PLUMMER, Andrew R et al.Applied mathematics letters. 2008, Vol 21, Num 10, pp 1037-1040, issn 0893-9659, 4 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

Toughness and Hamiltonicity of a class of planar graphsGERLACH, T.Discrete mathematics. 2004, Vol 286, Num 1-2, pp 61-65, issn 0012-365X, 5 p.Conference Paper

Hamiltonian colorings of graphsCHARTRAND, Gary; NEBESKY, Ladislav; PING ZHANG et al.Discrete applied mathematics. 2005, Vol 146, Num 3, pp 257-272, issn 0166-218X, 16 p.Article

PARAMETERIZED TRACTABILITY OF EDGE-DISJOINT PATHS ON DIRECTED ACYCLIC GRAPHSSLIVKINS, Aleksandrs.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 1, pp 146-157, issn 0895-4801, 12 p.Article

DETERMINANTS AND LONGEST CYCLES OF GRAPHSEJOV, Vladimir; FILAR, Jerzy A; MURRAY, Walter et al.SIAM journal on discrete mathematics (Print). 2009, Vol 22, Num 3, pp 1215-1225, issn 0895-4801, 11 p.Article

The spanning connectivity of line graphsHUANG, Po-Yi; HSU, Lih-Hsing.Applied mathematics letters. 2011, Vol 24, Num 9, pp 1614-1617, issn 0893-9659, 4 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

RELATIVE LENGTH OF LONGEST PATHS AND CYCLES IN 2-CONNECTED GRAPHSGENGHUA FAN; NAIDAN JI.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 3, pp 1238-1248, issn 0895-4801, 11 p.Article

A counterexample to the bipartizing matching conjectureHOFFMANN-OSTENHOF, Arthur.Discrete mathematics. 2007, Vol 307, Num 22, pp 2723-2733, issn 0012-365X, 11 p.Article

On the 2-factor index of a graphLIMING XIONG; MINGCHU LI.Discrete mathematics. 2007, Vol 307, Num 21, pp 2478-2483, issn 0012-365X, 6 p.Article

On a cycle through a specified linear forest of a graphGERLACH, Tobias; HARANT, Jochen.Discrete mathematics. 2007, Vol 307, Num 7-8, pp 892-895, issn 0012-365X, 4 p.Conference Paper

PROOF OF THE HAMILTONICITY-TRACE CONJECTURE FOR SINGULARLY PERTURBED MARKOV CHAINSEJOV, Vladimir; LITVAK, Nelly; NGUYEN, Giang T et al.Journal of applied probability. 2011, Vol 48, Num 4, pp 901-910, issn 0021-9002, 10 p.Article