{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T16:04:51Z","timestamp":1784045091630,"version":"3.55.0"},"reference-count":212,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,11,17]],"date-time":"2013-11-17T00:00:00Z","timestamp":1384646400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s00373-013-1377-x","type":"journal-article","created":{"date-parts":[[2013,11,16]],"date-time":"2013-11-16T05:50:30Z","timestamp":1384581030000},"page":"1-46","source":"Crossref","is-referenced-by-count":72,"title":["Recent Advances on the Hamiltonian Problem: Survey III"],"prefix":"10.1007","volume":"30","author":[{"given":"Ronald J.","family":"Gould","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,11,17]]},"reference":[{"key":"1377_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0012-365X(00)00425-8","volume":"236","author":"M.E.K. Abderrezzak","year":"2001","unstructured":"Abderrezzak M.E.K., Flandrin E., Amar D.: Cyclability and pancyclability in bipartite graphs. Discrete Math. 236, 3\u201311 (2001)","journal-title":"Discrete Math."},{"key":"1377_CR2","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1137\/S0895480104441267","volume":"20","author":"A. Abueida","year":"2006","unstructured":"Abueida A., Sritharan R.: Cycle extendability and Hamiltonian cycles in chordal graph classes. SIAM J. Discrete Math. 20, 669\u2013681 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"1377_CR3","unstructured":"Abueida, A., Busch, A., Sritharan, R.: Hamiltonian spider intersection graphs are cycle extendable (preprint)"},{"key":"1377_CR4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s00373-008-0835-3","volume":"25","author":"A. Ainouche","year":"2009","unstructured":"Ainouche A.: Dirac\u2019s type sufficient conditions for Hamiltonicity and pancyclicity. Graphs Combin. 25, 129\u2013137 (2009)","journal-title":"Graphs Combin."},{"key":"1377_CR5","first-page":"385","volume":"85","author":"A. Ainouche","year":"2007","unstructured":"Ainouche A.: Extensions of Bondy\u2019s theorem on cycles in 2-connected graphs. Ars Combin. 85, 385\u2013393 (2007)","journal-title":"Ars Combin."},{"key":"1377_CR6","first-page":"110","volume":"29","author":"A. Ainouche","year":"1990","unstructured":"Ainouche A., Broersma H.J., Veldman H.J.: Remarks on Hamiltonian properties of claw-free graphs. Ars Combin. 29, 110\u2013121 (1990)","journal-title":"Ars Combin."},{"key":"1377_CR7","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s003730050059","volume":"15","author":"A. Ainouche","year":"1999","unstructured":"Ainouche A., Kouider M.: Hamiltonism and partially square graphs. Graphs Combin. 15, 257\u2013265 (1999)","journal-title":"Graphs Combin."},{"key":"1377_CR8","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/j.disc.2005.11.021","volume":"306","author":"A. Ainouche","year":"2006","unstructured":"Ainouche A., Lapiquonne S.: Hamiltonian connectedness and partially square graphs. Discrete Math. 306, 1097\u20131104 (2006)","journal-title":"Discrete Math."},{"key":"1377_CR9","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s00373-002-0523-y","volume":"19","author":"A. Ainouche","year":"2003","unstructured":"Ainouche A., Schiermeyer I.: 0-Dual closures for several classes of graphs. Graphs Combin. 19, 297\u2013307 (2003)","journal-title":"Graphs Combin."},{"key":"1377_CR10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0012-365X(84)90041-4","volume":"50","author":"B. Alspach","year":"1984","unstructured":"Alspach B.: Research problem 59. Discrete Math. 50, 115 (1984)","journal-title":"Discrete Math."},{"key":"1377_CR11","first-page":"7","volume":"52","author":"B. Alspach","year":"2008","unstructured":"Alspach B.: The wonderful Walecki construction. Bull. Inst. Combin. Appl. 52, 7\u201320 (2008)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"1377_CR12","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.disc.2011.06.003","volume":"312","author":"B. Alspach","year":"2012","unstructured":"Alspach B., Bryant D., Dyer D.: Paley graphs have Hamilton decompositions. Discrete Math. 312, 113\u2013118 (2012)","journal-title":"Discrete Math."},{"key":"1377_CR13","doi-asserted-by":"crossref","first-page":"3088","DOI":"10.1016\/j.disc.2009.03.047","volume":"310","author":"R.F. Bailey","year":"2010","unstructured":"Bailey R.F., Stevens B.: Hamiltonian decompositions of complete k-uniform hypergraphs. Discrete Math. 310, 3088\u20133095 (2010)","journal-title":"Discrete Math."},{"key":"1377_CR14","doi-asserted-by":"crossref","first-page":"4479","DOI":"10.1016\/j.disc.2007.08.045","volume":"308","author":"Ch.S. Babu","year":"2008","unstructured":"Babu Ch.S., Diwan A.A.: Subdivisions of graphs: a generalization of paths and cycles. Discrete Math. 308, 4479\u20134486 (2008)","journal-title":"Discrete Math."},{"key":"1377_CR15","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1137\/11082378X","volume":"26","author":"D. Bal","year":"2012","unstructured":"Bal D., Frieze A.: Packing tight Hamilton cycles in uniform hypergraphs. SIAM J. Discrete Math. 26, 435\u2013451 (2012)","journal-title":"SIAM J. Discrete Math."},{"key":"1377_CR16","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1214\/10-AAP718","volume":"21","author":"J. Balogh","year":"2011","unstructured":"Balogh J., Bollob\u00e1s B., Krivelevich M., M\u00fcller T., Walters M.: Hamilton cycles in random geometric graphs. Ann. Appl. Probab. 21, 1053\u20131072 (2011)","journal-title":"Ann. Appl. Probab."},{"key":"1377_CR17","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/S0012-365X(02)00680-5","volume":"268","author":"R. Balakrishnan","year":"2003","unstructured":"Balakrishnan R., Bermond J.-C., Paulraja P., Yu M.-L.: On Hamilton cycle decompositions of the tensor product of complete graphs. Discrete Math. 268, 49\u201358 (2003)","journal-title":"Discrete Math."},{"key":"1377_CR18","unstructured":"Barnette, D.: Conjecture 5. In: Tutte, W. (ed.) Recent Progress in Combinatorics, p. 343. Academic Press, New York (1969)"},{"key":"1377_CR19","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1002\/jgt.21633","volume":"71","author":"D. Bauer","year":"2012","unstructured":"Bauer D., Schmeichel E.: Binding number, minimum degree, and cycle structure in graphs. J. Graph Theory 71, 219\u2013228 (2012)","journal-title":"J. Graph Theory"},{"key":"1377_CR20","unstructured":"Bedrosian, P.: Forbidden subgraphs and minimum degree conditions for Hamiltonicity. Ph.D. Thesis, Memphis State University (1991)"},{"key":"1377_CR21","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1137\/110821299","volume":"25","author":"S. Ben-Shimon","year":"2011","unstructured":"Ben-Shimon S., Krivelevich M., Sudakov B.: On the resilience of hamiltonicity and optimal packing of Hamiltonian cycles in random graphs. SIAM J. Discrete Math. 25, 1176\u20131193 (2011)","journal-title":"SIAM J. Discrete Math."},{"key":"1377_CR22","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0167-5060(08)70494-1","volume":"3","author":"J.-C. Bermond","year":"1978","unstructured":"Bermond J.-C.: Hamiltonian decompositions of graphs, directed graphs and hypergraphs. Advances in Graph Theory (Cambridge Combinatorial Conference, Trinity College, Cambridge, 1977). Ann. Discrete Math. 3, 21\u201328 (1978)","journal-title":"Ann. Discrete Math."},{"key":"1377_CR23","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0012-365X(88)90107-0","volume":"71","author":"J.-C. Bermond","year":"1988","unstructured":"Bermond J.-C.: Problem 97. Discrete Math. 71, 275 (1988)","journal-title":"Discrete Math."},{"key":"1377_CR24","first-page":"39","volume":"260","author":"J.-C. Bermond","year":"1976","unstructured":"Bermond J.-C., Germa A., Heydemann M.C., Sotteau D.: Hypergraphes hamiltoniens. Prob. Comb. Th\u00e9orie Graph Orsay 260, 39\u201343 (1976)","journal-title":"Prob. Comb. Th\u00e9orie Graph Orsay"},{"key":"1377_CR25","first-page":"2772","volume":"313","author":"Q. Bian","year":"2013","unstructured":"Bian Q., Horn P., Janiszewski S., La Fleur S., Gould R.J., Wrayno P.: 3-connected {K 1,3, P 9 }-free graphs are Hamiltonian connected. Graphs Combin. 313, 2772\u20132777 (2013)","journal-title":"Graphs Combin."},{"key":"1377_CR26","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/jgt.20276","volume":"57","author":"D.P. Biebighauser","year":"2008","unstructured":"Biebighauser D.P., Ellingham M.N.: Prism-Hamiltonicity of triangulations. J. Graph Theory 57, 181\u2013197 (2008)","journal-title":"J. Graph Theory"},{"key":"1377_CR27","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10986-011-9115-7","volume":"51","author":"M. Bloznelis","year":"2011","unstructured":"Bloznelis M., Radavi\u010dius I.: A note on Hamiltonicity of uniform random intersection graphs. Lith. Math. J. 51, 155\u2013161 (2011)","journal-title":"Lith. Math. J."},{"key":"1377_CR28","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/rsa.20272","volume":"35","author":"T. Bohman","year":"2009","unstructured":"Bohman T., Frieze A.: Hamilton cycles in 3-out. Random Struct. Algorithms 35, 393\u2013417 (2009)","journal-title":"Random Struct. Algorithms"},{"key":"1377_CR29","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/(SICI)1097-0118(199912)32:4<405::AID-JGT8>3.0.CO;2-Z","volume":"32","author":"T. B\u00f6hme","year":"1999","unstructured":"B\u00f6hme T., Harant J., Tk\u00e1\u010d M.: More than one tough chordal planar graphs are Hamiltonian. J. Graph Theory 32, 405\u2013410 (1999)","journal-title":"J. Graph Theory"},{"key":"1377_CR30","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0095-8956(71)90016-5","volume":"11","author":"J.A. Bondy","year":"1971","unstructured":"Bondy J.A.: Pancyclic graphs I. J. Combin. Theory Ser. B 11, 80\u201384 (1971)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1377_CR31","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1002\/rsa.20383","volume":"40","author":"J. B\u00f6ttcher","year":"2012","unstructured":"B\u00f6ttcher J., Kohayakawa Y., Procacci A.: Properly colored copies and rainbow copies of large graphs with small maximum degree. Random Struct. Algorithms 40, 425\u2013436 (2012)","journal-title":"Random Struct. Algorithms"},{"key":"1377_CR32","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/jgt.1008","volume":"37","author":"H. Broersma","year":"2001","unstructured":"Broersma H., Kriesell M., Ryj\u00e1\u010dek Z.: On factors of 4-connected claw-free graphs. J. Graph Theory 37, 125\u2013136 (2001)","journal-title":"J. Graph Theory"},{"key":"1377_CR33","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1002\/jgt.10034","volume":"40","author":"H. Broersma","year":"2002","unstructured":"Broersma H., Faudree R.J., Huck A., Trommel H., Veldman H.J.: Forbidden subgraphs that imply Hamiltonian connectedness. J. Graph Theory 40, 104\u2013119 (2002)","journal-title":"J. Graph Theory"},{"key":"1377_CR34","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s00373-011-1090-6","volume":"28","author":"H. Broersma","year":"2012","unstructured":"Broersma H., Ryjacek Z., Vr\u00e1na P.: How many conjectures can you stand? A survey. Graphs Combin. 28, 57\u201375 (2012)","journal-title":"Graphs Combin."},{"key":"1377_CR35","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1016\/j.disc.2005.11.051","volume":"307","author":"H. Broersma","year":"2007","unstructured":"Broersma H., Xiong L., Yoshimoto K.: Toughness and Hamiltonicity in k-trees. Discrete Math. 307, 832\u2013838 (2007)","journal-title":"Discrete Math."},{"key":"1377_CR36","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0012-365X(01)00326-0","volume":"251","author":"J. Brousek","year":"2002","unstructured":"Brousek J.: Forbidden triples for Hamiltonicity. Discrete Math. 251, 71\u201376 (2002)","journal-title":"Discrete Math."},{"key":"1377_CR37","unstructured":"Brunet, R., Nakamoto, A., Negami, S.: Every 5-connected triangulation of the Klein bottle is Hamiltonian. In: Proceedings of the 10th Workshop on Topological Graph Theory (Yokohama, 1998) Yokohama Mathematical Journal, vol. 47, pp. 239\u2013244 (1999)"},{"key":"1377_CR38","first-page":"331","volume":"31","author":"D. Bryant","year":"2005","unstructured":"Bryant D., Leach C.D., Rodger C.: Hamilton decompositions of complete bipartite graphs with 3-factor leaves. Australas. J. Combin. 31, 331\u2013336 (2005)","journal-title":"Australas. J. Combin."},{"key":"1377_CR39","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s00026-009-0039-4","volume":"13","author":"S. Butler","year":"2010","unstructured":"Butler S., Chung F.: Small spectral gap in the combinatorial Laplacian implies Hamiltonian. Ann. Comb. 13, 403\u2013412 (2010)","journal-title":"Ann. Comb."},{"key":"1377_CR40","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0012-365X(03)00304-2","volume":"276","author":"R. \u010cada","year":"2004","unstructured":"\u010cada R., Flandrin E., Li H., Ryj\u00e1\u010dek Z.: Cycles through given vertices and closures. Discrete Math. 276, 65\u201380 (2004)","journal-title":"Discrete Math."},{"key":"1377_CR41","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1023\/A:1021998507140","volume":"7","author":"C. Chen","year":"2003","unstructured":"Chen C.: Any maximal planar graph with only one separating triangle is Hamiltonian. J. Comb. Optim. 7, 79\u201386 (2003)","journal-title":"J. Comb. Optim."},{"key":"1377_CR42","doi-asserted-by":"crossref","first-page":"2015","DOI":"10.1016\/j.disc.2008.04.013","volume":"309","author":"B. Chen","year":"2009","unstructured":"Chen B., Zhang S., Qiao Q.: Hamilton cycles in claw-heavy graphs. Discrete Math. 309, 2015\u20132019 (2009)","journal-title":"Discrete Math."},{"key":"1377_CR43","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1016\/j.ejc.2003.04.003","volume":"25","author":"G. Chen","year":"2004","unstructured":"Chen G., Fan G., Yu X.: Cycles in 4-connected planar graphs. Eur. J. Combin. 25, 763\u2013780 (2004)","journal-title":"Eur. J. Combin."},{"key":"1377_CR44","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1137\/S0895480104441450","volume":"20","author":"G. Chen","year":"2006","unstructured":"Chen G., Faudree R.J., Gould R.J., Jacobson M.S.: Cycle extendability of Hamiltonian interval graphs. SIAM J. Discrete Math. 20, 682\u2013689 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"1377_CR45","doi-asserted-by":"crossref","first-page":"359","DOI":"10.7151\/dmgt.1236","volume":"24","author":"G. Chen","year":"2004","unstructured":"Chen G., Faudree R.J., Gould R.J., Jacobson M.S., Lesniak L., Pfender F.: Linear forests and ordered cycles. Discussiones Mathematicae Graph Theory 24, 359\u2013372 (2004)","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"1377_CR46","first-page":"25","volume":"29","author":"G. Chen","year":"2000","unstructured":"Chen G., Gould R.J.: Hamiltonian connected graphs involving forbidden subgraphs. Bull. Inst. Combin. Appl. 29, 25\u201332 (2000)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"1377_CR47","first-page":"245","volume":"70","author":"G. Chen","year":"2004","unstructured":"Chen G., Gould R.J., Pfender F.: New conditions for k-ordered Hamiltonian graphs. Ars Combin. 70, 245\u2013255 (2004)","journal-title":"Ars Combin."},{"key":"1377_CR48","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1016\/j.jctb.2011.10.005","volume":"102","author":"D. Christofides","year":"2012","unstructured":"Christofides D., K\u00fchn D., Osthus D.: Edge-disjoint Hamiltonian cycles in graphs. J. Combin. Theory Ser. B 102, 1035\u20131060 (2012)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1377_CR49","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","volume":"5","author":"V. Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal V.: Tough graphs and Hamiltonian circuits. Discrete Math. 5, 215\u2013223 (1973)","journal-title":"Discrete Math."},{"key":"1377_CR50","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(72)90079-9","volume":"2","author":"V. Chv\u00e1tal","year":"1972","unstructured":"Chv\u00e1tal V., Erd\u00f6s P.: A note on Hamiltonian circuits. Discrete Math. 2, 111\u2013113 (1972)","journal-title":"Discrete Math."},{"key":"1377_CR51","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1137\/080741379","volume":"24","author":"C. Cooper","year":"2010","unstructured":"Cooper C., Frieze A., Krivelevich M.: Hamilton graphs in random graphs with a fixed degree sequence. SIAM J. Discrete Math. 24, 558\u2013569 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"1377_CR52","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s00493-009-2360-2","volume":"29","author":"B. Cuckler","year":"2009","unstructured":"Cuckler B., Kahn J.: Hamiltonian cycles in Dirac graphs. Combinatorica 29, 299\u2013326 (2009)","journal-title":"Combinatorica"},{"key":"1377_CR53","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1016\/j.disc.2007.11.059","volume":"309","author":"Q. Cui","year":"2009","unstructured":"Cui Q., Hu Y., Wang J.: Long cycles in 4-connected planar graphs. Discrete Math. 309, 1051\u20131059 (2009)","journal-title":"Discrete Math."},{"key":"1377_CR54","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/060665300","volume":"21","author":"J. Diaz","year":"2007","unstructured":"Diaz J., Mitsche D., P\u00e9rez X.: Sharp threshold for Hamiltonicity of random geometric graphs. SIAM J. Discrete Math. 21, 57\u201365 (2007)","journal-title":"SIAM J. Discrete Math."},{"key":"1377_CR55","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"G.A. Dirac","year":"1952","unstructured":"Dirac G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2, 69\u201381 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"key":"1377_CR56","unstructured":"Dudek, A., Ferrara, M.: Extensions of results on rainbow Hamilton cycles in uniform hypergraphs (preprint)"},{"key":"1377_CR57","doi-asserted-by":"crossref","unstructured":"Dudek, A., Frieze, A.: Loose Hamiltonian cycles in random uniform hypergraphs. Electron. J. Combin. 18 (2011), Paper 48","DOI":"10.37236\/535"},{"key":"1377_CR58","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1002\/rsa.20404","volume":"42","author":"A. Dudek","year":"2012","unstructured":"Dudek A., Frieze A.: Tight Hamilton cycles in random uniform hypergraphs. Random Struct. Algorithms 42, 374\u2013385 (2012)","journal-title":"Random Struct. Algorithms"},{"key":"1377_CR59","doi-asserted-by":"crossref","unstructured":"Dudek, A., Frieze, A., Loh, P.-S., Speiss, S.: Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs. Electron. J. Combin. 19 (2012), Paper 44","DOI":"10.37236\/2523"},{"key":"1377_CR60","doi-asserted-by":"crossref","unstructured":"Dudek, A., Frieze, A., Rucinski, A.: Rainbow Hamilton cycles in uniform hypergraphs. Electron. J. Combin. 19 (2012), Paper 46","DOI":"10.37236\/2055"},{"key":"1377_CR61","unstructured":"Duffus, D., Gould, R.J., Jacobson, M.S.: Forbidden subgraphs and the Hamiltonian theme. In: Chartrand, Alavi, Goldsmith, Lesniak, Lick (eds.) The Theory and Applications of Graphs, (Kalmazoo, Mich., 1980), pp. 297\u2013316. Wiley, New York (1981)"},{"key":"1377_CR62","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0095-8956(91)90086-Y","volume":"52","author":"Y. Egawa","year":"1991","unstructured":"Egawa Y., Glas R., Locke S.: Cycles and paths through specified vertices in k-connected graphs. J. Combin. Theory Ser. B 52, 20\u201329 (1991)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1377_CR63","doi-asserted-by":"crossref","unstructured":"Efthymiou, C., Spitakas, P.G.: On the existence of Hamiltonian cycles in random intersection graphs. Lecture Notes in Computer Science, pp. 690\u2013701. Springer, Berlin (2005)","DOI":"10.1007\/11523468_56"},{"key":"1377_CR64","doi-asserted-by":"crossref","first-page":"3714","DOI":"10.1016\/j.tcs.2010.06.022","volume":"411","author":"C. Efthymiou","year":"2010","unstructured":"Efthymiou C., Spirakas P.G.: Sharp thresholds for hamiltonicity in random intersection graphs. Theor. Comput. Sci. 411, 3714\u20133730 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"1377_CR65","unstructured":"Enomoto, H.: Personal communication"},{"key":"1377_CR66","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0095-8956(84)90054-6","volume":"37","author":"G.H. Fan","year":"1984","unstructured":"Fan G.H.: New sufficient condition for cycles in graphs. J. Combin. Theory B 37, 221\u2013227 (1984)","journal-title":"J. Combin. Theory B"},{"key":"1377_CR67","first-page":"78","volume":"5","author":"J.R. Faudree","year":"2009","unstructured":"Faudree J.R., Faudree R.J.: Hamiltonian cycles containing ordered linear forests. Bull. Inst. Combin. Appl. 5, 78\u2013104 (2009)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"1377_CR68","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/1097-0118(200010)35:2<69::AID-JGT1>3.0.CO;2-I","volume":"35","author":"J.R. Faudree","year":"2000","unstructured":"Faudree J.R., Faudree R.J., Gould R.J., Jacobson M.S., Lesniak L.: On k-ordered graphs. J. Graph Theory 35, 69\u201382 (2000)","journal-title":"J. Graph Theory"},{"key":"1377_CR69","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1002\/jgt.21645","volume":"72","author":"J.R. Faudree","year":"2013","unstructured":"Faudree J.R., Faudree R.J., Ryj\u00e1\u010dk Z., Vr\u00e1na P.: On forbidden pairs implying Hamilton-connectedness. J. Graph Theory 72, 327\u2013345 (2013)","journal-title":"J. Graph Theory"},{"key":"1377_CR70","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0012-365X(96)00147-1","volume":"173","author":"R.J. Faudree","year":"1997","unstructured":"Faudree R.J., Gould R.J.: Characterizing forbidden pairs for Hamiltonian properties. Discrete Math. 173, 45\u201360 (1997)","journal-title":"Discrete Math."},{"key":"1377_CR71","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0012-365X(01)00235-7","volume":"249","author":"R.J. Faudree","year":"2002","unstructured":"Faudree R.J., Gould R.J., Jacobson M.J., Lesniak L.: Characterizing forbidden clawless triples implying Hamiltonian graphs. Discrete Math. 249, 71\u201381 (2002)","journal-title":"Discrete Math."},{"key":"1377_CR72","doi-asserted-by":"crossref","first-page":"47","DOI":"10.7151\/dmgt.1212","volume":"24","author":"R.J. Faudree","year":"2004","unstructured":"Faudree R.J., Gould R.J., Jacobson M.S.: Forbidden triples implying hamiltonicity: for all graphs. Discuss. Math. Graph Theory 24, 47\u201354 (2004)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1377_CR73","doi-asserted-by":"crossref","first-page":"273","DOI":"10.7151\/dmgt.1281","volume":"25","author":"R.J. Faudree","year":"2005","unstructured":"Faudree R.J., Gould R.J., Jacobson M.S.: Potential forbidden triples implying Hamiltonicity: for sufficiently large graphs. Discuss. Math. Graph Theory 25, 273\u2013289 (2005)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1377_CR74","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s00373-005-0604-5","volume":"21","author":"R.J. Faudree","year":"2005","unstructured":"Faudree R.J., Gould R.J., Jacobson M.S., Lesniak L.: Minimum degree and (k,m)-pancyclic ordered graphs. Graphs Combin. 21, 197\u2013211 (2005)","journal-title":"Graphs Combin."},{"key":"1377_CR75","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1002\/jgt.10084","volume":"42","author":"R.J. Faudree","year":"2003","unstructured":"Faudree R.J., Gould R.J., Kostochka A., Lesniak L., Schiermeyer I., Saito A.: Degree conditions for k-ordered Hamiltonian graphs. J. Graph Theory 42, 199\u2013210 (2003)","journal-title":"J. Graph Theory"},{"key":"1377_CR76","unstructured":"Faudree, R.J., Gould, R.J., Jacobson, M.S.: Pancyclic graphs and linear forests. Discrete Math. (2013, to appear)"},{"key":"1377_CR77","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1002\/jgt.20564","volume":"69","author":"R.J. Faudree","year":"2012","unstructured":"Faudree R.J., Gould R.J., Jacobson M.S., Magnant C.: Distributing vertices on Hamiltonian cycles. J. Graph Theory 69, 28\u201345 (2012)","journal-title":"J. Graph Theory"},{"key":"1377_CR78","doi-asserted-by":"crossref","unstructured":"Faudree, R.J., Gould, R.J.: Precise location of vertices on Hamiltonian cycles. Discrete Math. 313(23), 2772\u20132777 (2013)","DOI":"10.1016\/j.disc.2013.08.012"},{"key":"1377_CR79","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s00373-004-0576-x","volume":"20","author":"R.J. Faudree","year":"2004","unstructured":"Faudree R.J., Gould R.J., Jacobson M.S., Lesniak L.: Generalizing pancyclic and k-ordered graphs. Graphs Combin. 20, 291\u2013309 (2004)","journal-title":"Graphs Combin."},{"key":"1377_CR80","unstructured":"Faudree, R.J., Lehel, J., Yoshimoto, K.: A note on locating pairs of vertices on a Hamiltonian cycle (preprint)"},{"key":"1377_CR81","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0012-365X(98)00399-9","volume":"206","author":"O. Favaron","year":"1999","unstructured":"Favaron O., Flandrin E., Li H., Tian F.: An Ore-type condition for pancyclability. Discrete Math. 206, 139\u2013144 (1999)","journal-title":"Discrete Math."},{"key":"1377_CR82","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/jgt.20632","volume":"71","author":"M. Ferrara","year":"2012","unstructured":"Ferrara M., Gould R.J., Jacobson M.S., Pfender F., Powell J., Whalen T.: New Ore-type conditions for H-linked graphs. J. Graph Theory 71, 69\u201377 (2012)","journal-title":"J. Graph Theory"},{"key":"1377_CR83","doi-asserted-by":"crossref","first-page":"3811","DOI":"10.1016\/j.disc.2008.10.026","volume":"309","author":"M. Ferrara","year":"2009","unstructured":"Ferrara M., Gould R.J., Tansey G., Whalen T.: Disjoint Hamiltonian cycles in bipartite graphs. Discrete Math. 309, 3811\u20133820 (2009)","journal-title":"Discrete Math."},{"key":"1377_CR84","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s00373-006-0651-6","volume":"22","author":"M. Ferrara","year":"2006","unstructured":"Ferrara M., Gould R.J., Tansey G., Whalen T.: On H-linked graphs. Graphs Combin. 22, 217\u2013224 (2006)","journal-title":"Graphs Combin."},{"key":"1377_CR85","first-page":"191","volume":"48","author":"M. Ferrara","year":"2010","unstructured":"Ferrara M., Jacobson M.S., Harlan A.: Hamiltonian cycles avoiding sets of edges in a graph. Australas. J. Combin. 48, 191\u2013203 (2010)","journal-title":"Australas. J. Combin."},{"key":"1377_CR86","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s00373-010-0911-3","volume":"26","author":"M. Ferrara","year":"2010","unstructured":"Ferrara M., Magnant C., Powell J.: Pan-H-linked graphs. Graphs Combin. 26, 225\u2013242 (2010)","journal-title":"Graphs Combin."},{"key":"1377_CR87","doi-asserted-by":"crossref","first-page":"2170","DOI":"10.1016\/j.laa.2009.01.005","volume":"432","author":"M. Fiedler","year":"2010","unstructured":"Fiedler M., Nikiforov V.: Spectral radius and hamiltonicity of graphs. Linear Algebra Appl. 432, 2170\u20132173 (2010)","journal-title":"Linear Algebra Appl."},{"key":"1377_CR88","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.disc.2003.11.045","volume":"286","author":"E. Flandrin","year":"2004","unstructured":"Flandrin E., Li H., Marczyk A., Wo\u017eniak M.: A note on pancyclism of highly connected graphs. Discrete Math. 286, 57\u201360 (2004)","journal-title":"Discrete Math."},{"key":"1377_CR89","doi-asserted-by":"crossref","first-page":"1531","DOI":"10.1016\/j.disc.2010.01.018","volume":"310","author":"J. Florek","year":"2010","unstructured":"Florek J.: On Barnette\u2019s conjecture. Discrete Math. 310, 1531\u20131535 (2010)","journal-title":"Discrete Math."},{"key":"1377_CR90","doi-asserted-by":"crossref","first-page":"1415","DOI":"10.1016\/j.disc.2007.07.074","volume":"308","author":"P. Frankl","year":"2008","unstructured":"Frankl P., Katona Gy.Y.: Extremal k-edge Hamiltonian hypergraphs. Discrete Math. 308, 1415\u20131424 (2008)","journal-title":"Discrete Math."},{"key":"1377_CR91","doi-asserted-by":"crossref","unstructured":"Frieze, A.: Loose Hamilton cycles in random 3-uniform hypergraphs. Electron. J. Combin. 17, #N283 (2010)","DOI":"10.37236\/477"},{"key":"1377_CR92","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.jctb.2004.12.003","volume":"94","author":"A. Frieze","year":"2005","unstructured":"Frieze A., Krivelevich M.: On packing Hamilton cycles in \u03b5-regular graphs. J. Combin. Theory B 94, 159\u2013172 (2005)","journal-title":"J. Combin. Theory B"},{"key":"1377_CR93","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/rsa.20374","volume":"40","author":"A. Frieze","year":"2012","unstructured":"Frieze A., Krivelevich M., Loh P.-S.: Packing tight Hamilton cycles in 3-uniform hypergraphs. Random Struct. Algorithms 40, 269\u2013300 (2012)","journal-title":"Random Struct. Algorithms"},{"key":"1377_CR94","doi-asserted-by":"crossref","first-page":"6111","DOI":"10.1016\/j.disc.2007.11.033","volume":"308","author":"J. Fujisawa","year":"2008","unstructured":"Fujisawa J., Ota K., Sugiyama T., Tsugaki M.: Forbidden subgraphs and the existence of paths and cycles through specified vertices. Discrete Math. 308, 6111\u20136114 (2008)","journal-title":"Discrete Math."},{"key":"1377_CR95","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.jctb.2012.08.004","volume":"103","author":"J. Fujisawa","year":"2013","unstructured":"Fujisawa J., Nakamoto A., Ozeki K.: Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices. J. Combin. Theory B 103, 46\u201360 (2013)","journal-title":"J. Combin. Theory B"},{"key":"1377_CR96","doi-asserted-by":"crossref","first-page":"1612","DOI":"10.1016\/j.disc.2007.04.018","volume":"308","author":"J. Fujisawa","year":"2008","unstructured":"Fujisawa J., Yamashita T.: Degree conditions on claws and modified claws for hamiltonicity of graphs. Discrete Math. 308, 1612\u20131619 (2008)","journal-title":"Discrete Math."},{"key":"1377_CR97","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.disc.2003.11.046","volume":"286","author":"T. Gerlach","year":"2004","unstructured":"Gerlach T.: Toughness and hamiltonicity of a class of planar graphs. Discrete Math. 286, 61\u201365 (2004)","journal-title":"Discrete Math."},{"key":"1377_CR98","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1137\/120884316","volume":"27","author":"R. Glebov","year":"2013","unstructured":"Glebov R., Krivelevich M.: On the number of Hamilton cycles in sparse random graphs. SIAM J. Discrete Math. 27, 27\u201342 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"1377_CR99","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/j.ejc.2011.10.003","volume":"33","author":"R. Glebov","year":"2012","unstructured":"Glebov R., Person Y., Weps W.: On extremal hypergraphs for Hamiltonian cycles. Eur. J. Combin. 33, 544\u2013555 (2012)","journal-title":"Eur. J. Combin."},{"key":"1377_CR100","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s00373-004-0565-0","volume":"20","author":"W. Goddard","year":"2004","unstructured":"Goddard W.: Minimum degree conditions for cycles including specified sets of vertices. Graphs Combin. 20, 467\u2013483 (2004)","journal-title":"Graphs Combin."},{"key":"1377_CR101","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/jgt.3190150204","volume":"15","author":"R.J. Gould","year":"1991","unstructured":"Gould R.J.: Updating the Hamiltonian problem\u2014a survey. J. Graph Theory 15, 121\u2013157 (1991)","journal-title":"J. Graph Theory"},{"key":"1377_CR102","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/s00373-002-0492-x","volume":"19","author":"R.J. Gould","year":"2003","unstructured":"Gould R.J.: Advances on the Hamiltonian problem\u2014a survey. Graphs Combin. 19, 7\u201352 (2003)","journal-title":"Graphs Combin."},{"key":"1377_CR103","doi-asserted-by":"crossref","first-page":"6299","DOI":"10.1016\/j.disc.2008.04.017","volume":"309","author":"R.J. Gould","year":"2009","unstructured":"Gould R.J.: A look at cycles containing specified elements of a graph. Discrete Math. 309, 6299\u20136311 (2009)","journal-title":"Discrete Math."},{"key":"1377_CR104","unstructured":"Gould, R.J.: Graph Theory, Dover Publications, Inc., Mineola (2012)"},{"key":"1377_CR105","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1002\/jgt.20030","volume":"47","author":"R.J. Gould","year":"2004","unstructured":"Gould R.J., Luczak T., Pfender F.: Pancyclicity of 3-connected graphs: pairs of forbidden subgraphs. J. Graph Theory 47, 183\u2013202 (2004)","journal-title":"J. Graph Theory"},{"key":"1377_CR106","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1137\/050624662","volume":"20","author":"R.J. Gould","year":"2006","unstructured":"Gould R.J., Kostochka A., Yu G.: On minimum degree implying that a graph is H-linked. SIAM J. Discrete Math. 20, 829\u2013840 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"1377_CR107","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s00373-006-0665-0","volume":"23","author":"R.J. Gould","year":"2007","unstructured":"Gould R.J., Whalen T.: Subdivision extendibility. Graphs Combin. 23, 165\u2013182 (2007)","journal-title":"Graphs Combin."},{"key":"1377_CR108","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.jctb.2003.07.001","volume":"90","author":"C. Greenhill","year":"2004","unstructured":"Greenhill C., Kim J.H., Wormald N.: Hamiltonian decompositions of random bipartite regular graphs. J. Combin. Theory Ser. B 90, 195\u2013222 (2004)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1377_CR109","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1090\/S0002-9904-1970-12601-5","volume":"76","author":"B. Gr\u00fcnbaum","year":"1970","unstructured":"Gr\u00fcnbaum B.: Polytopes graphs and complexes. Bull. Am. Math. Soc. 76, 1131\u20131201 (1970)","journal-title":"Bull. Am. Math. Soc."},{"key":"1377_CR110","unstructured":"H\u00e4ggkvist, R.: On F-Hamiltonian graphs. In: Bondy, J.A., Murty, U.S.R. (eds) Graphs and Related Topics, pp. 219\u2013231. Academic Press, New York (1979)"},{"key":"1377_CR111","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/j.jctb.2009.10.002","volume":"100","author":"H. H\u00e1n","year":"2010","unstructured":"H\u00e1n H., Schacht M.: Dirac-type results for loose Hamilton cycles in uniform hypergraphs. J. Combin. Theory B 100, 332\u2013346 (2010)","journal-title":"J. Combin. Theory B"},{"key":"1377_CR112","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/1097-0118(200007)34:3<191::AID-JGT1>3.0.CO;2-V","volume":"34","author":"A. Harkat-Benhamdine","year":"2000","unstructured":"Harkat-Benhamdine A., Li H., Tian F.: Cyclability of 3-connected graphs. J. Graph Theory 34, 191\u2013203 (2000)","journal-title":"J. Graph Theory"},{"key":"1377_CR113","unstructured":"Hartke, S., Seacrest, T.: Random partitions and edge disjoint Hamiltonian cycles (preprint)"},{"key":"1377_CR114","doi-asserted-by":"crossref","first-page":"1833","DOI":"10.1016\/j.dam.2007.03.018","volume":"155","author":"G. Helden","year":"2007","unstructured":"Helden G.: Each maximal planar graph with exactly two separating triangles is Hamiltonian. Discrete Appl. Math. 155, 1833\u20131836 (2007)","journal-title":"Discrete Appl. Math."},{"key":"1377_CR115","doi-asserted-by":"crossref","unstructured":"Helden, G., Vieten, O.: Hamiltonian cycles in maximal planar graphs. In: Cologne-Twente Workshop on Graphs and Combinatorial Optimization 71, Electronic Notes in Discrete Mathematics, vol. 25, Elsevier, Amsterdam (2006)","DOI":"10.1016\/j.endm.2006.06.092"},{"key":"1377_CR116","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0095-8956(85)90072-3","volume":"38","author":"D.L. Holton","year":"1985","unstructured":"Holton D.L., Manvel B., McKay B.D.: Hamiltonian cycles in cubic 3-connected bipartite graphs. J. Combin. Theory B 38, 279\u2013297 (1985)","journal-title":"J. Combin. Theory B"},{"key":"1377_CR117","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1002\/jgt.20099","volume":"50","author":"Z. Hu","year":"2005","unstructured":"Hu Z., Tian F., Bing W.: Hamiltonian connectivity of line graphs and claw-free graphs. J. Graph Theory 50, 130\u2013141 (2005)","journal-title":"J. Graph Theory"},{"key":"1377_CR118","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1112\/jlms\/s2-19.1.13","volume":"19","author":"B. Jackson","year":"1979","unstructured":"Jackson B.: Edge-disjoint Hamiltonian cycles in regular graphs of large degree. J. Lond. Math. Soc. 19, 13\u201316 (1979)","journal-title":"J. Lond. Math. Soc."},{"key":"1377_CR119","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/S0012-365X(02)00505-8","volume":"257","author":"T. Jiang","year":"2002","unstructured":"Jiang T.: Planar Hamiltonian chordal graphs are cycle extendable. Discrete Math. 257, 441\u2013444 (2002)","journal-title":"Discrete Math."},{"key":"1377_CR120","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s00373-005-0639-7","volume":"22","author":"T. Kaiser","year":"2006","unstructured":"Kaiser T., Kriesell M.: On the pancyclicity of lexicographic products. Graphs Combin. 22, 51\u201358 (2006)","journal-title":"Graphs Combin."},{"key":"1377_CR121","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1016\/j.ejc.2011.09.015","volume":"33","author":"T. Kaiser","year":"2012","unstructured":"Kaiser T., Vr\u00e1na P.: Hamilton cycles in 5-connected line graphs. Eur. J. Combin. 33, 924\u2013947 (2012)","journal-title":"Eur. J. Combin."},{"key":"1377_CR122","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1006\/jctb.2000.1999","volume":"81","author":"A. Kaneko","year":"2001","unstructured":"Kaneko A., Yoshimoto K.: On a Hamiltonian cycle in which specified vertices are uniformly distributed. J. Combin. Theory Ser. B 81, 100\u2013109 (2001)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1377_CR123","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1017\/S0963548398003459","volume":"8","author":"M. Karo\u0144ski","year":"1999","unstructured":"Karo\u0144ski M., Scheinerman E., Singer-Cohen K.: On random intersection graphs: the subgraph problem. Combin. Prob. Comput. 8, 131\u2013159 (1999)","journal-title":"Combin. Prob. Comput."},{"key":"1377_CR124","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/(SICI)1097-0118(199903)30:3<205::AID-JGT5>3.0.CO;2-O","volume":"30","author":"G.Y. Katona","year":"1999","unstructured":"Katona G.Y., Kierstead H.: Hamiltonian chains in hypergraphs. J. Graph Theory 30, 205\u2013212 (1999)","journal-title":"J. Graph Theory"},{"key":"1377_CR125","first-page":"25","volume":"7","author":"K. Kawarabayashi","year":"2001","unstructured":"Kawarabayashi K.: A survey on Hamiltonian cycles. Interdiscip. Inf. Sci. 7, 25\u201339 (2001)","journal-title":"Interdiscip. Inf. Sci."},{"key":"1377_CR126","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1002\/rsa.20362","volume":"39","author":"P. Keevash","year":"2013","unstructured":"Keevash P.: A hypergraph blow-up lemma. Random Struct. Algorithms 39, 275\u2013376 (2013)","journal-title":"Random Struct. Algorithms"},{"key":"1377_CR127","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/j.disc.2010.11.013","volume":"311","author":"P. Keevash","year":"2011","unstructured":"Keevash P., K\u00fchn D., Mycroft R., Osthus D.: Loose Hamilton cycles in hypergraphs. Discrete Math. 311, 544\u2013559 (2011)","journal-title":"Discrete Math."},{"key":"1377_CR128","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1002\/(SICI)1097-0118(199909)32:1<17::AID-JGT2>3.0.CO;2-G","volume":"32","author":"H. Kierstead","year":"1999","unstructured":"Kierstead H., S\u00e1rk\u00f6zy G., Selkow S.: On k-ordered Hamiltonian graphs. J. Graph Theory 32, 17\u201325 (1999)","journal-title":"J. Graph Theory"},{"key":"1377_CR129","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1002\/rsa.20365","volume":"40","author":"F. Knox","year":"2012","unstructured":"Knox F., K\u00fchn D., Osthus D.: Approximate Hamilton decompositions of random graphs. Random Struct. Algorithms 40, 133\u2013149 (2012)","journal-title":"Random Struct. Algorithms"},{"key":"1377_CR130","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1002\/jgt.20115","volume":"50","author":"A. Kostochka","year":"2005","unstructured":"Kostochka A., Yu G.: An extremal problem for H-linked graphs. J. Graph Theory 50, 321\u2013339 (2005)","journal-title":"J. Graph Theory"},{"key":"1377_CR131","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1006\/jctb.2001.2040","volume":"82","author":"M. Kriesell","year":"2001","unstructured":"Kriesell M.: All 4-connected line graphs of claw-free graphs are Hamiltonian connected. J. Combin. Theory B 82, 306\u2013315 (2001)","journal-title":"J. Combin. Theory B"},{"key":"1377_CR132","doi-asserted-by":"crossref","unstructured":"Krivelevich, M.: On the number of Hamilton cycles in pseudo-random graphs. Electron. J. Combin. 19 (2012), Paper 24","DOI":"10.37236\/1177"},{"key":"1377_CR133","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/110849171","volume":"26","author":"M. Krivelevich","year":"2012","unstructured":"Krivelevich M., Samotij W.: Optimal packings of Hamilton cycles in sparse random graphs. SIAM J. Discrete Math. 26, 964\u2013982 (2012)","journal-title":"SIAM J. Discrete Math."},{"key":"1377_CR134","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1002\/jgt.10065","volume":"42","author":"M. Krivelevich","year":"2003","unstructured":"Krivelevich M., Sudakov B.: Sparse pseudo-random graphs are Hamiltonian. J. Graph Theory 42, 17\u201333 (2003)","journal-title":"J. Graph Theory"},{"key":"1377_CR135","first-page":"77","volume":"21","author":"H. Kronk","year":"1969","unstructured":"Kronk H.: A generalization of a theorem of P\u00f3sa. Proc. Am. Math. Soc. 21, 77\u201378 (1969)","journal-title":"Proc. Am. Math. Soc."},{"key":"1377_CR136","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1017\/S0963548312000569","volume":"22","author":"D. K\u00fchn","year":"2013","unstructured":"K\u00fchn D., Lapinskas J., Osthus D.: Optimal packings of Hamilton cycles in graphs of high minimum degree. Combin. Prob. Comput. 22, 394\u2013416 (2013)","journal-title":"Combin. Prob. Comput."},{"key":"1377_CR137","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/j.jctb.2006.02.004","volume":"96","author":"D. K\u00fchn","year":"2006","unstructured":"K\u00fchn D., Osthus D.: Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree. J. Combin. Theory Ser. B 96, 767\u2013821 (2006)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1377_CR138","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.aim.2013.01.005","volume":"237","author":"D. K\u00fchn","year":"2013","unstructured":"K\u00fchn D., Osthus D.: Hamilton decompositions of regular expanders: a proof of Kelly\u2019s conjecture for large tournaments. Adv. Math. 237, 62\u2013146 (2013)","journal-title":"Adv. Math."},{"key":"1377_CR139","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/j.ejc.2011.09.030","volume":"33","author":"D. K\u00fchn","year":"2012","unstructured":"K\u00fchn D., Osthus D.: A survey on Hamilton cycles in directed graphs. Eur. J. Combin. 33, 750\u2013766 (2012)","journal-title":"Eur. J. Combin."},{"key":"1377_CR140","unstructured":"Kuipers, E.J., Veldman, H.: Recognizing claw-free Hamiltonian graphs with large minimum degree. Memo, 1437, Department of Applied Mathematics, University of Twente, Enschede (1998)"},{"key":"1377_CR141","doi-asserted-by":"crossref","first-page":"982","DOI":"10.1016\/j.dam.2008.02.005","volume":"157","author":"H.-J. Lai","year":"2009","unstructured":"Lai H.-J., Shao Y., Yu G., Zhan M.: Hamiltonian connectedness in 3-connected line graphs. Discrete Appl. Math. 157, 982\u2013990 (2009)","journal-title":"Discrete Appl. Math."},{"key":"1377_CR142","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/j.jctb.2005.10.003","volume":"96","author":"H.-J. Lai","year":"2006","unstructured":"Lai H.-J., Shao Y., Zhan M.: Hamiltonicity in 3-connected claw-free graphs. J. Combin. Theory B 96, 493\u2013504 (2006)","journal-title":"J. Combin. Theory B"},{"key":"1377_CR143","doi-asserted-by":"crossref","first-page":"5312","DOI":"10.1016\/j.disc.2007.09.045","volume":"308","author":"H.-J. Lai","year":"2008","unstructured":"Lai H.-J., Shao Y., Zhan M.: Every 4-connected line graph of a quasi-claw-free graph is Hamiltonian connected. Discrete Math. 308, 5312\u20135316 (2008)","journal-title":"Discrete Math."},{"key":"1377_CR144","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.20433","volume":"64","author":"H.-J. Lai","year":"2010","unstructured":"Lai H.-J., Xiong L., Yan H., Yan J.: Every 3-connected claw-free Z 8-free graph is Hamiltonian. J. Graph Theory 64, 1\u201311 (2010)","journal-title":"J. Graph Theory"},{"key":"1377_CR145","unstructured":"Lafond, M., Seamone, B.: Some Hamiltonian chordal graphs are not cycle extendable (preprint)"},{"key":"1377_CR146","unstructured":"Las Vergnas, M.: Thesis, University of Paris, Paris (1972)"},{"key":"1377_CR147","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0012-365X(03)00281-4","volume":"279","author":"C.D. Leach","year":"2004","unstructured":"Leach C.D., Rodger C.: Hamilton decompositions of complete graphs with 3-factor leaves. Discrete Math. 279, 337\u2013344 (2004)","journal-title":"Discrete Math."},{"key":"1377_CR148","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1002\/jgt.10142","volume":"44","author":"C.D. Leach","year":"2003","unstructured":"Leach C.D., Rodger C.: Hamilton decompositions of complete multipartite graphs with any 2-factor leave. J. Graph Theory 44, 208\u2013214 (2003)","journal-title":"J. Graph Theory"},{"key":"1377_CR149","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/rsa.20419","volume":"41","author":"C. Lee","year":"2012","unstructured":"Lee C., Sudakov B.: Dirac\u2019s theorem for random graphs. Random Struct. Algorithms 41, 293\u2013305 (2012)","journal-title":"Random Struct. Algorithms"},{"key":"1377_CR150","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0012-365X(01)00279-5","volume":"250","author":"G. Li","year":"2002","unstructured":"Li G., Lu M., Liu Z.: Hamiltonian cycles in 3-connected claw-free graphs. Discrete Math. 250, 137\u2013151 (2002)","journal-title":"Discrete Math."},{"key":"1377_CR151","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0012-365X(02)00882-8","volume":"265","author":"R. Li","year":"2003","unstructured":"Li R.: Hamiltonicity of 3-connected quasi-claw-free graphs. Discrete Math. 265, 393\u2013399 (2003)","journal-title":"Discrete Math."},{"key":"1377_CR152","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0012-365X(02)00687-8","volume":"268","author":"R. Li","year":"2003","unstructured":"Li R., Schelp R.: Every 3-connected distance claw-free graph is Hamiltonian connected. Discrete Math. 268, 185\u2013197 (2003)","journal-title":"Discrete Math."},{"key":"1377_CR153","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1002\/jgt.20558","volume":"68","author":"M. Li","year":"2011","unstructured":"Li M., Chen X., Broersma H.: Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs. J. Graph Theory 68, 285\u2013298 (2011)","journal-title":"J. Graph Theory"},{"key":"1377_CR154","first-page":"193","volume":"58","author":"J. Li","year":"2001","unstructured":"Li J., Shen R., Tian F.: Cycles containing given subsets in 1-tough graphs. Ars Combin. 58, 193\u2013204 (2001)","journal-title":"Ars Combin."},{"key":"1377_CR155","first-page":"341","volume":"20","author":"M. Li","year":"2004","unstructured":"Li M.: Hamiltonian connected claw-free graphs. Graphs Combin. 20, 341\u2013362 (2004)","journal-title":"Graphs Combin."},{"key":"1377_CR156","doi-asserted-by":"crossref","unstructured":"Lu, L., Sz\u00e9kely, L.: Using Lov\u00e1sz local lemma in the space of random injections. Electron. J. Combin. 14, 13 (2007) Paper 63","DOI":"10.37236\/981"},{"key":"1377_CR157","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1002\/jgt.20019","volume":"47","author":"T. Luczak","year":"2004","unstructured":"Luczak T., Pfender F.: Claw-free 3-connected P 11-free graphs are Hamiltonian. J. Graph Theory 47, 111\u2013121 (2004)","journal-title":"J. Graph Theory"},{"key":"1377_CR158","unstructured":"Malkevitch, J.: Polytopal graphs. In: Beineke, Wilson (eds.) Selected Topics in Graph Theory, vol. 3. Academic Press, New York, pp. 169\u2013188 (1988)"},{"key":"1377_CR159","first-page":"33","volume":"80","author":"R.S. Manikandan","year":"2006","unstructured":"Manikandan R.S., Paulraja P.: Hamiltonian decompositions of the tensor product of a complete graph and a complete bipartite graph. Ars Combin. 80, 33\u201344 (2006)","journal-title":"Ars Combin."},{"key":"1377_CR160","doi-asserted-by":"crossref","first-page":"3586","DOI":"10.1016\/j.disc.2007.07.020","volume":"308","author":"R.S. Manikandan","year":"2008","unstructured":"Manikandan R.S., Paulraja P.: Hamilton cycle decompositions of the tensor product of complete multipartite graphs. Discrete Math. 308, 3586\u20133606 (2008)","journal-title":"Discrete Math."},{"key":"1377_CR161","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/jgt.3190080116","volume":"8","author":"M. Matthews","year":"1984","unstructured":"Matthews M., Sumner D.: Hamiltonian results in K 1,3-free graphs. J. Graph Theory 8, 139\u2013146 (1984)","journal-title":"J. Graph Theory"},{"key":"1377_CR162","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0166-218X(92)90230-8","volume":"36","author":"B. Mohar","year":"1992","unstructured":"Mohar B.: A domain monotonicity theorem for graphs and hamiltonicity. Discrete Appl. Math. 36, 169\u2013177 (1992)","journal-title":"Discrete Appl. Math."},{"key":"1377_CR163","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02759704","volume":"1","author":"J. Moon","year":"1963","unstructured":"Moon J., Moser L.: On Hamiltonian bipartite graphs. Isr. J. Math. 1, 163\u2013165 (1963)","journal-title":"Isr. J. Math."},{"key":"1377_CR164","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1002\/jgt.20560","volume":"68","author":"T. M\u00fcller","year":"2011","unstructured":"M\u00fcller T., P\u00e9rez-Gim\u00e9nez X., Wormald N.: Disjoint Hamilton cycles in the random geometric graph. J. Graph Theory 68, 299\u2013322 (2011)","journal-title":"J. Graph Theory"},{"key":"1377_CR165","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/jgt.20569","volume":"69","author":"A. Nakamoto","year":"2012","unstructured":"Nakamoto A., Ozeki K.: Hamiltonian cycles in bipartite quadrangulations on the torus. J. Graph Theory 69, 143\u2013151 (2012)","journal-title":"J. Graph Theory"},{"key":"1377_CR166","unstructured":"Nash-Williams, C.St.J.A.: Edge-Disjoint Hamiltonian Circuits in Graphs Having Sufficiently Large Valencies. Studies in Pure Mathematics. Academic Press, London, pp. 157\u2013183 (1971)"},{"key":"1377_CR167","unstructured":"Nash-Williams, C.St.J.A.: Unexplored and Semi-Explored Territories in Graph Theory. New Directions in Graph Theory. Academic Press, New York, pp. 169\u2013176 (1973)"},{"key":"1377_CR168","doi-asserted-by":"crossref","first-page":"6750","DOI":"10.1016\/j.tcs.2011.09.003","volume":"412","author":"S. Nikoletseas","year":"2011","unstructured":"Nikoletseas S., Raptopoulos C., Spitakis P.G.: On the independence number and Hamiltonicity of uniform random intersection graphs. Theor. Comput. Sci. 412, 6750\u20136760 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"1377_CR169","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/(SICI)1097-0118(199701)24:1<45::AID-JGT6>3.0.CO;2-J","volume":"24","author":"L. Ng","year":"1997","unstructured":"Ng L., Schultz M.: k-ordered Hamiltonian graphs. J. Graph Theory 24, 45\u201357 (1997)","journal-title":"J. Graph Theory"},{"key":"1377_CR170","first-page":"199","volume":"8","author":"E.A. Okol\u2019nishnikova","year":"2005","unstructured":"Okol\u2019nishnikova E.A.: On the number of Hamiltonian cycles in dense Hamiltonian graphs. (Russ.) Mat. Tr. 8, 199\u2013206 (2005)","journal-title":"(Russ.) Mat. Tr."},{"key":"1377_CR171","doi-asserted-by":"crossref","unstructured":"Ore, O.: A note on Hamiltonian circuits. Am. Math. Mon. 67, 55 (1960)","DOI":"10.2307\/2308928"},{"key":"1377_CR172","doi-asserted-by":"crossref","unstructured":"Perez Reilly, E., Scheinerman, E.: Random threshold graphs. Electron. J. Combin. 16, Paper 130 (2009)","DOI":"10.37236\/219"},{"key":"1377_CR173","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1002\/jgt.20080","volume":"49","author":"F. Pfender","year":"2005","unstructured":"Pfender F.: Hamiltonicity and forbidden subgraphs in 4-connected graphs. J. Graph Theory 49, 262\u2013272 (2005)","journal-title":"J. Graph Theory"},{"key":"1377_CR174","doi-asserted-by":"crossref","first-page":"303","DOI":"10.7151\/dmgt.1283","volume":"25","author":"D.A. Pike","year":"2005","unstructured":"Pike D.A.: Hamilton decompositions of line graphs of some bipartite graph. Discuss. Math. Graph Theory 25, 303\u2013310 (2005)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1377_CR175","first-page":"355","volume":"8","author":"L. P\u00f3sa","year":"1963","unstructured":"P\u00f3sa L.: On the circuits of finite graphs. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 8, 355\u2013361 (1963)","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"1377_CR176","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s00373-011-1042-1","volume":"28","author":"S. Qiao","year":"2012","unstructured":"Qiao S., Zhang S.: Spanning cyclic subdivisions of vertex-disjoint cycles and chorded cycles in graphs. Graphs Combin. 28, 277\u2013285 (2012)","journal-title":"Graphs Combin."},{"key":"1377_CR177","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1002\/rsa.3240050209","volume":"5","author":"R.W. Robinson","year":"1994","unstructured":"Robinson R.W., Wormald N.: Almost all regular graphs are Hamiltonian. Random Struct. Algorithms 5, 363\u2013374 (1994)","journal-title":"Random Struct. Algorithms"},{"key":"1377_CR178","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s00373-004-0573-0","volume":"20","author":"C. Rodger","year":"2004","unstructured":"Rodger C.: Hamiltonian decomposable graphs with specified leaves. Graphs Combin. 20, 541\u2013543 (2004)","journal-title":"Graphs Combin."},{"key":"1377_CR179","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1017\/S0963548305007042","volume":"15","author":"V. R\u00f6dl","year":"2006","unstructured":"R\u00f6dl V., Rucinski A., Szemer\u00e9di E.: A Dirac-type theorem for 3-uniform hypergraphs. Combin. Probab. Comput. 15, 229\u2013251 (2006)","journal-title":"Combin. Probab. Comput."},{"issue":"2","key":"1377_CR180","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s00493-008-2295-z","volume":"28","author":"V. R\u00f6dl","year":"2008","unstructured":"R\u00f6dl V., Rucinski A., Szemer\u00e9di E.: An approximate Dirac-type theorem for k-uniform hypergraphs. Combinatorica 28(2), 229\u2013260 (2008)","journal-title":"Combinatorica"},{"key":"1377_CR181","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1016\/j.aim.2011.03.007","volume":"227","author":"V. R\u00f6dl","year":"2011","unstructured":"R\u00f6dl V., Ruci\u0144ski A., Szemer\u00e9di E.: Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs. Adv. Math. 227, 1225\u20131229 (2011)","journal-title":"Adv. Math."},{"key":"1377_CR182","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0012-365X(73)90132-5","volume":"5","author":"M. Rosenfeld","year":"1973","unstructured":"Rosenfeld M., Barnette D.: Hamiltonian circuits in certain prisms. Discrete Math. 5, 389\u2013394 (1973)","journal-title":"Discrete Math."},{"key":"1377_CR183","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1006\/jctb.1996.1732","volume":"70","author":"Z. Ryj\u00e1\u010dek","year":"1997","unstructured":"Ryj\u00e1\u010dek Z.: On a closure concept in claw-free graphs. J. Combin. Theory B 70, 217\u2013224 (1997)","journal-title":"J. Combin. Theory B"},{"key":"1377_CR184","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1002\/jgt.20498","volume":"66","author":"Z. Ryj\u00e1\u010dek","year":"2011","unstructured":"Ryj\u00e1\u010dek Z., Vr\u00e1na P.: Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs. J. Graph Theory 66, 152\u2013173 (2011)","journal-title":"J. Graph Theory"},{"key":"1377_CR185","doi-asserted-by":"crossref","unstructured":"Rybarczyk, K.: Sharp threshold functions for random intersection graphs via a coupling method. Electron. J. Combin. 18, Paper 36 (2011)","DOI":"10.37236\/523"},{"key":"1377_CR186","first-page":"33","volume":"58","author":"T. Sakai","year":"2001","unstructured":"Sakai T.: Long paths and cycles through specified vertices in k-connected graphs. Ars Combin. 58, 33\u201365 (2001)","journal-title":"Ars Combin."},{"key":"1377_CR187","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1002\/(SICI)1097-0118(199704)24:4<341::AID-JGT6>3.0.CO;2-O","volume":"24","author":"D.P. Sanders","year":"1997","unstructured":"Sanders D.P.: On paths in planar graphs. J. Graph Theory 24, 341\u2013345 (1997)","journal-title":"J. Graph Theory"},{"key":"1377_CR188","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0012-365X(02)00582-4","volume":"265","author":"G. S\u00e1rkozy","year":"2003","unstructured":"S\u00e1rkozy G., Selkow S., Szemer\u00e9di E.: On the number of Hamiltonian cycles in Dirac graphs. Discrete Math. 265, 237\u2013250 (2003)","journal-title":"Discrete Math."},{"key":"1377_CR189","doi-asserted-by":"crossref","first-page":"5757","DOI":"10.1016\/j.disc.2007.10.042","volume":"308","author":"G. S\u00e1rkozy","year":"2008","unstructured":"S\u00e1rkozy G., Selkow S.: Distributing vertices along a Hamiltonian cycle in Dirac graphs. Discrete Math. 308, 5757\u20135770 (2008)","journal-title":"Discrete Math."},{"key":"1377_CR190","first-page":"127","volume":"80","author":"I. Sciriha","year":"2012","unstructured":"Sciriha I., Cardoso D.M.: Necessary and sufficient conditions for a Hamiltonian graph. J. Combin. Math. Combin. Comput. 80, 127\u2013150 (2012)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"1377_CR191","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0095-8956(91)90074-T","volume":"53","author":"F.B. Shepherd","year":"1991","unstructured":"Shepherd F.B.: Hamiltonicity in claw-free graphs. J. Combin. Theory B 53, 173\u2013194 (1991)","journal-title":"J. Combin. Theory B"},{"key":"1377_CR192","doi-asserted-by":"crossref","first-page":"6382","DOI":"10.1016\/j.disc.2008.11.003","volume":"309","author":"Z. Skupien","year":"2009","unstructured":"Skupien Z.: Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles. Discrete Math. 309, 6382\u20136390 (2009)","journal-title":"Discrete Math."},{"key":"1377_CR193","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1002\/rsa.20235","volume":"33","author":"B. Sudakov","year":"2008","unstructured":"Sudakov B., Vu V.: Local resilience of graphs. Random Struct. Algorithms 33, 409\u2013433 (2008)","journal-title":"Random Struct. Algorithms"},{"key":"1377_CR194","doi-asserted-by":"crossref","first-page":"103","DOI":"10.55937\/sut\/1108749122","volume":"40","author":"T. Sugiyama","year":"2004","unstructured":"Sugiyama T.: Hamiltonian cycles through a linear forest. Sut. J. Math. 40, 103\u2013109 (2004)","journal-title":"Sut. J. Math."},{"key":"1377_CR195","doi-asserted-by":"crossref","unstructured":"Tait, P.G.: Remark on the coloring of maps. Proc. R. Soc. Edinb. 10, 729 (1880)","DOI":"10.1017\/S0370164600044643"},{"key":"1377_CR196","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1006\/jctb.1994.1058","volume":"62","author":"R. Thomas","year":"1994","unstructured":"Thomas R., Yu X.: 4-connected projective planar graphs are Hamiltonian. J. Combin. Theory B 62, 114\u2013132 (1994)","journal-title":"J. Combin. Theory B"},{"key":"1377_CR197","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1006\/jctb.1996.1713","volume":"69","author":"R. Thomas","year":"1997","unstructured":"Thomas R., Yu X.: Five-connected toroidal graphs are Hamiltonian. J. Combin. Theory B 69, 79\u201396 (1997)","journal-title":"J. Combin. Theory B"},{"key":"1377_CR198","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.jctb.2005.01.002","volume":"94","author":"R. Thomas","year":"2005","unstructured":"Thomas R., Yu X., Zang W.: Hamilton paths in toroidal graphs. J. Combin. Theory B 94, 214\u2013236 (2005)","journal-title":"J. Combin. Theory B"},{"key":"1377_CR199","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1002\/jgt.3190070205","volume":"9","author":"C. Thomassen","year":"1983","unstructured":"Thomassen C.: A theorem on paths in planar graphs. J. Graph Theory 9, 169\u2013176 (1983)","journal-title":"J. Graph Theory"},{"key":"1377_CR200","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0167-5060(08)70511-9","volume":"3","author":"A.G. Thomason","year":"1978","unstructured":"Thomason A.G.: Hamiltonian cycles and uniquely edge colorable graphs. Ann. Discrete Math. 3, 259\u2013268 (1978)","journal-title":"Ann. Discrete Math."},{"key":"1377_CR201","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/jgt.3190100308","volume":"10","author":"C. Thomassen","year":"1986","unstructured":"Thomassen C.: Reflections on graph theory. J. Graph Theory 10, 309\u2013324 (1986)","journal-title":"J. Graph Theory"},{"key":"1377_CR202","first-page":"221","volume":"34","author":"F. Tian","year":"2005","unstructured":"Tian F., Wei B.: Pancyclicity mod k of K 1,4-free graphs. Adv. Math. (China) 34, 221\u2013232 (2005)","journal-title":"Adv. Math. (China)"},{"key":"1377_CR203","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1090\/S0002-9947-1956-0081471-8","volume":"82","author":"W. Tutte","year":"1956","unstructured":"Tutte W.: A theorem on planar graphs. Trans. Am. Math. Soc. 82, 309\u2013324 (1956)","journal-title":"Trans. Am. Math. Soc."},{"key":"1377_CR204","first-page":"179","volume":"61","author":"Z. Tuza","year":"2006","unstructured":"Tuza Z.: Steiner system and large non-Hamiltonian hypergraphs. Matematiche 61, 179\u2013183 (2006)","journal-title":"Matematiche"},{"key":"1377_CR205","doi-asserted-by":"crossref","unstructured":"van den Heuvel, J.: Hamilton cycles and eigenvalues of graphs. Linear Algebra Appl. 226\u2013228, 723\u2013730 (1995)","DOI":"10.1016\/0024-3795(95)00254-O"},{"key":"1377_CR206","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0012-365X(92)00572-9","volume":"132","author":"H. Verrall","year":"1994","unstructured":"Verrall H.: Hamiltonian decompositions of complete 3-uniform hypergraphs. Discrete Math. 132, 333\u2013348 (1994)","journal-title":"Discrete Math."},{"key":"1377_CR207","doi-asserted-by":"crossref","first-page":"5106","DOI":"10.1016\/j.disc.2009.03.043","volume":"309","author":"E. Westland","year":"2009","unstructured":"Westland E., Liu J., Kreher D.: 6-regular Cayley graphs on abelian groups of odd order are Hamiltonian decomposable. Discrete Math. 309, 5106\u20135110 (2009)","journal-title":"Discrete Math."},{"key":"1377_CR208","doi-asserted-by":"crossref","first-page":"378","DOI":"10.2307\/1968197","volume":"32","author":"H. Whitney","year":"1931","unstructured":"Whitney H.: A theorem on graphs. Ann. Math. 32, 378\u2013390 (1931)","journal-title":"Ann. Math."},{"key":"1377_CR209","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0012-365X(84)90010-4","volume":"51","author":"D. Witte","year":"1984","unstructured":"Witte D., Gallian J.: A survey: Hamiltonian cycles in Cayley graphs. Discrete Math. 51, 293\u2013304 (1984)","journal-title":"Discrete Math."},{"key":"1377_CR210","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0012-365X(98)00216-7","volume":"196","author":"Z. Yang","year":"1999","unstructured":"Yang Z.: Note on F-Hamiltonian graphs. Discrete Math. 196, 281\u2013286 (1999)","journal-title":"Discrete Math."},{"key":"1377_CR211","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1090\/S0002-9947-97-01830-8","volume":"349","author":"X. Yu","year":"1997","unstructured":"Yu X.: Disjoint paths, planarizing cycles, and spanning walks. Trans. Am. Math. Soc. 349, 1333\u20131358 (1997)","journal-title":"Trans. Am. Math. Soc."},{"key":"1377_CR212","first-page":"350","volume":"6","author":"J. Zhou","year":"2001","unstructured":"Zhou J., Lin C., Hu G.: Spectral radius of Hamiltonian planar graphs and outerplanar graphs. Tsinghua Sci. Technol. 6, 350\u2013354 (2001)","journal-title":"Tsinghua Sci. Technol."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1377-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1377-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1377-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,19]],"date-time":"2024-05-19T13:47:35Z","timestamp":1716126455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1377-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,17]]},"references-count":212,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["1377"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1377-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,17]]}}}