{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T23:33:25Z","timestamp":1780097605449,"version":"3.54.0"},"reference-count":170,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":5605,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1991,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This is intended as a survey article covering recent developments in the area of hamiltonian graphs, that is, graphs containing a spanning cycle. This article also contains some material on related topics such as traceable, hamiltonian\u2010connected and pancyclic graphs and digraphs, as well as an extensive bibliography of papers in the area.<\/jats:p>","DOI":"10.1002\/jgt.3190150204","type":"journal-article","created":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T06:48:37Z","timestamp":1181285317000},"page":"121-157","source":"Crossref","is-referenced-by-count":96,"title":["Updating the hamiltonian problem\u2014A survey"],"prefix":"10.1002","volume":"15","author":[{"given":"Ronald J.","family":"Gould","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190040310"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-32.3.385"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(87)90025-4"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"B.Alspach Hamiltonian cycles in vertex\u2010transitive graphs of order2p. Ulilitas Math.(1979) 131\u2013139.","DOI":"10.1111\/j.1749-6632.1979.tb32769.x"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(83)90042-4"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(81)80026-3"},{"key":"e_1_2_1_8_2","unstructured":"D.Amar I.Fournier A.Germa andR.H\u00e4ggkvist Covering the vertices of a simple graph with given connectivity and stability number. International Conference on Convexity and Graph Theory Israel (1980)."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90045-X"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90109-4"},{"key":"e_1_2_1_11_2","first-page":"55","article-title":"Two theorems on hamiltonian graphs","volume":"35","author":"Asratyan A. S.","year":"1984","journal-title":"Mat. Zamethki"},{"key":"e_1_2_1_12_2","unstructured":"A. S.AsratyanandN. K.Khachatryan On a stability of some properties of a graph. Preprint."},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(82)90163-7"},{"key":"e_1_2_1_14_2","volume-title":"Problem 17, unsolved problems. Summer Research Workshop in Algebraic Combinatorics","author":"Babai L.","year":"1979"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190030314"},{"key":"e_1_2_1_16_2","unstructured":"D.Bauer H. J.Broersma andH. J.Veldman On generalizing a theorem of Jung. Preprint."},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(89)90023-3"},{"key":"e_1_2_1_18_2","article-title":"Recognizing tough graphs is NP\u2010hard","author":"Bauer D.","journal-title":"Discrete Math."},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90055-M"},{"key":"e_1_2_1_20_2","unstructured":"D.Bauer E.Schmeichel andH. J.Veldman Some recent results on long cycles in tough graphs. Proceedings of the Sixth International Conference on the Theory and Applications of Graphs to appear."},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190100317"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(87)90115-4"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(87)90038-4"},{"key":"e_1_2_1_24_2","volume-title":"Selected Topics in Graph Theory","author":"Bermond J. C.","year":"1978"},{"key":"e_1_2_1_25_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190050102"},{"key":"e_1_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01295234"},{"key":"e_1_2_1_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(83)80039-0"},{"key":"e_1_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579230"},{"key":"e_1_2_1_29_2","volume-title":"Random Graphs","author":"Bollob\u00e1s B.","year":"1985"},{"key":"e_1_2_1_30_2","first-page":"430","article-title":"An algorithm for finding Hamilton cycles in random graphs","volume":"17","author":"Bollob\u00e1s B.","year":"1985","journal-title":"Proceedings of the ACM Symposium on the Theory of Computing"},{"key":"e_1_2_1_31_2","article-title":"Powers of Hamiltonian cycles in tournaments","author":"Bollob\u00e1s B.","journal-title":"J. Combinat. Theory B"},{"key":"e_1_2_1_32_2","first-page":"3","article-title":"Hamilton cycles in graphs and digraphs","volume":"21","author":"Bondy J. A.","year":"1978","journal-title":"Congr. Numer."},{"key":"e_1_2_1_33_2","volume-title":"Longest paths and cycles in graphs of high degree. Research Report CORR 80\u201316, Department of Combinatorics and Optimization, Faculty of Mathematics","author":"Bondy J. A.","year":"1980"},{"key":"e_1_2_1_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(76)90078-9"},{"key":"e_1_2_1_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(87)90029-X"},{"key":"e_1_2_1_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02190157"},{"key":"e_1_2_1_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(76)90064-2"},{"key":"e_1_2_1_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(88)90086-X"},{"key":"e_1_2_1_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579268"},{"key":"e_1_2_1_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"e_1_2_1_41_2","first-page":"35","volume-title":"Theory of Graphs (International Symposium, Rome, 1966)","author":"Bosak J.","year":"1967"},{"key":"e_1_2_1_42_2","unstructured":"H. J.BroersmaandH. J.Veldman Restrictions on induced subgraphs ensuring hamiltonicity or pancyclicity ofK1 3\u2010free graphs. Preprint."},{"key":"e_1_2_1_43_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190050312"},{"key":"e_1_2_1_44_2","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1972.40.53"},{"key":"e_1_2_1_45_2","volume-title":"Graphs and Digraphs","author":"Chartrand G.","year":"1986"},{"key":"e_1_2_1_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(87)90044-X"},{"key":"e_1_2_1_47_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(73)90138-6"},{"key":"e_1_2_1_48_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(72)90079-9"},{"key":"e_1_2_1_49_2","first-page":"189","article-title":"A conjecture on dominating cycles","volume":"47","author":"Clark B. N.","year":"1985","journal-title":"Congr. Numer."},{"key":"e_1_2_1_50_2","first-page":"131","article-title":"Hamiitonian\u2010like indices of graphs","volume":"15","author":"Clark L. H.","year":"1983","journal-title":"Ars Combinat."},{"key":"e_1_2_1_51_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130608"},{"key":"e_1_2_1_52_2","unstructured":"A. M.Dean C. J.Knickerbocker P. F.Lock andM.Sheard A survey of graphs hamiltonian\u2010connected from a vertex. Preprint."},{"key":"e_1_2_1_53_2","unstructured":"I. J.Dejter Hamilton cycles in bipartite reflective Kneser graphs. Preprint."},{"key":"e_1_2_1_54_2","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-2.1.69"},{"key":"e_1_2_1_55_2","first-page":"297","volume-title":"Theory and Applications of Graphs (Kalamazoo, Michigan, 1980)","author":"Duffus D. A.","year":"1981"},{"key":"e_1_2_1_56_2","article-title":"Matchings and Hamiltonian cycles in some families of symmetric graphs","author":"Duffus D. A.","journal-title":"J. Combinat. Theory B"},{"key":"e_1_2_1_57_2","unstructured":"Y.Egawa R.Gals andS. C.Locke Cycles and paths through specified vertices in k\u2010connected graphs. Preprint."},{"key":"e_1_2_1_58_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(83)90046-1"},{"key":"e_1_2_1_59_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090106"},{"key":"e_1_2_1_60_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90054-6"},{"key":"e_1_2_1_61_2","first-page":"227","article-title":"Neighborhood closures for graphs","volume":"52","author":"Faudree R. J.","year":"1987","journal-title":"Colloq. Math. Societ. Janos Bolyai"},{"key":"e_1_2_1_62_2","article-title":"On a generalization of Dirac's theorem","author":"Faudree R. J.","journal-title":"Discrete Math."},{"key":"e_1_2_1_63_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(89)90060-9"},{"key":"e_1_2_1_64_2","unstructured":"R. J.Faudree R. J.Gould andT.Lindquester Hamiltonian properties and adjacency conditions inK1 3\u2010free graphs.Proceedings of the 6th International Conference on Theory and Applications of Graphs Kalamazoo 1988 to appear."},{"key":"e_1_2_1_65_2","first-page":"55","article-title":"Neighborhood conditions and edge disjoint Hamiltonian cycles","volume":"59","author":"Faudree R. J.","year":"1987","journal-title":"Congr. Numer."},{"key":"e_1_2_1_66_2","first-page":"231","volume-title":"Graph Theory with Applications to Algorithms and Computer Science (Kalamazoo, Michigan, 1984)","author":"Faudree R. J.","year":"1985"},{"key":"e_1_2_1_67_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90046-8"},{"key":"e_1_2_1_68_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90066-2"},{"key":"e_1_2_1_69_2","unstructured":"E.Flandrin H. A.Jung andH.Li Hamiltonism degree sums and neighborhood intersections. Preprint."},{"key":"e_1_2_1_70_2","volume-title":"Hamiltonism and claws. Report de Recherehe no. 398","author":"Flandrin E.","year":"1988"},{"key":"e_1_2_1_71_2","volume-title":"Hamiltonism and neighborhood intersections. Report de Recherehe no. 406","author":"Flandrin E.","year":"1988"},{"key":"e_1_2_1_72_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90091-4"},{"key":"e_1_2_1_73_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01305995"},{"key":"e_1_2_1_74_2","unstructured":"P.Fraisse D\u03bb\u2010cycles and their applications for Hamiltonian graphs. Preprint."},{"key":"e_1_2_1_75_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190100316"},{"key":"e_1_2_1_76_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(88)90089-5"},{"key":"e_1_2_1_77_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(85)80046-9"},{"key":"e_1_2_1_78_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90061-6"},{"key":"e_1_2_1_79_2","unstructured":"R. J.Gould Traceability in graphs. Doctoral thesis Western Michigan University (1979)."},{"key":"e_1_2_1_80_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(82)90216-3"},{"key":"e_1_2_1_81_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190080117"},{"key":"e_1_2_1_82_2","unstructured":"R. J.GouldandM. S.Jacobson Neighborhood intersections and a generalization of Ore's theorem.Proceedings of the 2nd International Conference in Graph Theory Combinatorics Algorithms and Applications San Francisco July 1989 to appear."},{"key":"e_1_2_1_83_2","first-page":"51","article-title":"Plane homogeneous graphs of degree three without hamiltonian circuits","volume":"4","author":"Grinberg E. J.","year":"1968","journal-title":"Latvian Math. Yearbook"},{"key":"e_1_2_1_84_2","doi-asserted-by":"publisher","DOI":"10.1137\/0216034"},{"key":"e_1_2_1_85_2","first-page":"219","volume-title":"Graph Theory and Related Topics","author":"H\u00e4ggkvist R.","year":"1979"},{"key":"e_1_2_1_86_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(82)90078-4"},{"key":"e_1_2_1_87_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(81)90102-7"},{"key":"e_1_2_1_88_2","article-title":"A cycle structure theorem for hamiltonian graphs","volume":"44","author":"Hakimi S.","year":"1988","journal-title":"J. Combinat. Theory B"},{"key":"e_1_2_1_89_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190030407"},{"key":"e_1_2_1_90_2","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1965-051-3"},{"key":"e_1_2_1_91_2","doi-asserted-by":"publisher","DOI":"10.1017\/S1446788700011563"},{"key":"e_1_2_1_92_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090415"},{"key":"e_1_2_1_93_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90072-3"},{"key":"e_1_2_1_94_2","first-page":"43","article-title":"On hamiltonian cycles of complete n\u2010partite graphs (Russian summary)","volume":"29","author":"Horak P.","year":"1979","journal-title":"Math. Slovaca"},{"key":"e_1_2_1_95_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-19.1.13"},{"key":"e_1_2_1_96_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(80)90042-8"},{"key":"e_1_2_1_97_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(87)90001-3"},{"key":"e_1_2_1_98_2","first-page":"39","article-title":"Chv\u00e1tal\u2010Erd\u00f6s conditions for 2\u2010cyclability in digraphs","volume":"25","author":"Jackson B.","year":"1988","journal-title":"Ars Combinat."},{"key":"e_1_2_1_99_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70503-X"},{"key":"e_1_2_1_100_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01899448"},{"key":"e_1_2_1_101_2","first-page":"1","volume-title":"Algorithms and Complexity: New Directions and Recent Results","author":"Karp M.","year":"1976"},{"key":"e_1_2_1_102_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00337621"},{"key":"e_1_2_1_103_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90021-3"},{"key":"e_1_2_1_104_2","first-page":"760","article-title":"Solution of a problem of Erd\u00f6s and R\u00e9nyi on Hamilton cycles in non\u2010oriented graphs","volume":"17","author":"Korshunov A. D.","year":"1976","journal-title":"Soviet Mat. Dokl."},{"key":"e_1_2_1_105_2","first-page":"17","article-title":"A solution of a problem of P. Erd\u00f6s and A. R\u00e9nyi About Hamilton cycles in nonoriented graphs","volume":"31","author":"Korshunov A. D.","year":"1977","journal-title":"Metody Diskr. Anal. Teoriy Upr. Syst. Sb. Trudov Novosibirsk"},{"key":"e_1_2_1_106_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190120103"},{"key":"e_1_2_1_107_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(88)90176-8"},{"key":"e_1_2_1_108_2","volume-title":"The Traveling Salesman Problem","author":"Lawler E. L.","year":"1986"},{"key":"e_1_2_1_109_2","unstructured":"L.Lesniak Neighborhood unions and graphical properties.Proceedings of the 6th International Conference on the Theory and Application of Graphs (Kalamazoo 1988) to appear."},{"key":"e_1_2_1_110_2","unstructured":"H.LiandY.Zhu Edge\u2010disjoint Hamilton cycles in graphs.Proceedings of the 1st China\u2010USA Conference to appear."},{"key":"e_1_2_1_111_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130309"},{"key":"e_1_2_1_112_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(85)90058-5"},{"key":"e_1_2_1_113_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579378"},{"key":"e_1_2_1_114_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90022-5"},{"key":"e_1_2_1_115_2","first-page":"82","article-title":"Problem","volume":"4","author":"Lov\u00e1sz L.","year":"1974","journal-title":"5. Period. Math. Hungar."},{"key":"e_1_2_1_116_2","volume-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz L.","year":"1979"},{"key":"e_1_2_1_117_2","volume-title":"Combinatorial Structures and Their Applications","author":"Lov\u00e1sz L.","year":"1970"},{"key":"e_1_2_1_118_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(82)90220-5"},{"key":"e_1_2_1_119_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90024-9"},{"key":"e_1_2_1_120_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(76)90066-6"},{"key":"e_1_2_1_121_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190080116"},{"key":"e_1_2_1_122_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090208"},{"key":"e_1_2_1_123_2","doi-asserted-by":"publisher","DOI":"10.2307\/1426466"},{"key":"e_1_2_1_124_2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.2307\/1426987","article-title":"General first\u2010passage percolation","volume":"15","author":"McDiarmid C. J. H.","year":"1983","journal-title":"Adv. Appl. Probab."},{"key":"e_1_2_1_125_2","first-page":"271","volume-title":"Graphs and Applications (Boulder, Colorado, 1982)","author":"Mitchem J.","year":"1985"},{"key":"e_1_2_1_126_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(73)90016-6"},{"key":"e_1_2_1_127_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1979.tb32816.x"},{"key":"e_1_2_1_128_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90070-4"},{"key":"e_1_2_1_129_2","first-page":"157","volume-title":"Studies in Pure Mathematics","author":"Nash\u2010Williams C. St. J. A.","year":"1971"},{"key":"e_1_2_1_130_2","first-page":"294","article-title":"Two edge\u2010disjoint Hamiltonian cycles of powers of graph","volume":"110","author":"Nebesky L.","year":"1985","journal-title":"Casopi Pest. Mat."},{"key":"e_1_2_1_131_2","first-page":"431","volume-title":"Recent Advances in Graph Theory (Proceedings of the Second Czechoslovak Symposium, Prague, 1974)","author":"Nincak J.","year":"1975"},{"key":"e_1_2_1_132_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190030405"},{"key":"e_1_2_1_133_2","doi-asserted-by":"publisher","DOI":"10.2307\/2308928"},{"key":"e_1_2_1_134_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(80)90072-6"},{"key":"e_1_2_1_135_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(84)90106-7"},{"key":"e_1_2_1_136_2","first-page":"225","article-title":"A theorem concerning hamilton lines","volume":"1","author":"P\u00f3sa L.","year":"1962","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"e_1_2_1_137_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(76)90068-6"},{"key":"e_1_2_1_138_2","first-page":"141","article-title":"On Hamiltonian cycles in 3\u2010connected cubic maps","volume":"27","author":"Richmond L. B.","year":"1985","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_139_2","article-title":"A new proof of a theorem by Fleischner","author":"Riha S.","journal-title":"J. Combinat. Theory B"},{"key":"e_1_2_1_140_2","unstructured":"G. N.Robertson Graphs with girth valency and connectivity constraints. Ph.D. thesis University of Waterloo Ontario (1968)."},{"key":"e_1_2_1_141_2","unstructured":"R. W.RobinsonandN. C.Wormald Almost all bipartite cubic graphs are hamiltonian. Preprint."},{"key":"e_1_2_1_142_2","first-page":"55","article-title":"A polynomial algorithm for hamiltonian graphs based on transformations","volume":"25","author":"Schiermeyer I.","year":"1988","journal-title":"Ars Combinat."},{"key":"e_1_2_1_143_2","unstructured":"I.Schiermeyer A strong closure concept for Hamiltonian graphs. Preprint."},{"key":"e_1_2_1_144_2","first-page":"57","article-title":"The problem of finding a Hamilton cycle (contour) in the presence of exclusions","volume":"19","author":"Serdjukov A. I.","year":"1979","journal-title":"Upravljaemye Sistemy"},{"key":"e_1_2_1_145_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579348"},{"key":"e_1_2_1_146_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190010110"},{"key":"e_1_2_1_147_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0017089500003001"},{"key":"e_1_2_1_148_2","unstructured":"Z.Skupien Sharp sufficient conditions for hamiltonian cycles in tough graphs. Preprint."},{"key":"e_1_2_1_149_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(69)80093-1"},{"key":"e_1_2_1_150_2","first-page":"611","article-title":"Connectivity and hamiltonian properties of the disjunction of undirected graphs","volume":"19","author":"Teichert H. M.","year":"1983","journal-title":"Elektron. Infortnatsverab. Kybernet"},{"key":"e_1_2_1_151_2","first-page":"67","article-title":"Hamiltonian properties of the lexicographic product of undirected graphs","volume":"19","author":"Teichert H. M.","year":"1983","journal-title":"Elektron. Informationsverarb. Kybernet."},{"key":"e_1_2_1_152_2","first-page":"345","article-title":"On the pancyclicity of some product graphs","volume":"19","author":"Teichert H. M.","year":"1983","journal-title":"Elektron. Informationsverarb. Kybernet"},{"key":"e_1_2_1_153_2","first-page":"639","article-title":"On the cartesian sum of undirected graphs","volume":"18","author":"Teichert H. M.","year":"1982","journal-title":"Elektron. Informationsverarb. Kybernet"},{"key":"e_1_2_1_154_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70511-9"},{"key":"e_1_2_1_155_2","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-42.2.231"},{"key":"e_1_2_1_156_2","first-page":"305","volume-title":"Graph Theory and Combinatorics","author":"Thomassen C.","year":"1984"},{"key":"e_1_2_1_157_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90011-3"},{"key":"e_1_2_1_158_2","first-page":"499","article-title":"Hamiltonian property of regular graphs","volume":"29","author":"Tomescu I.","year":"1984","journal-title":"Rev. Roumaine Math. Press Appl."},{"key":"e_1_2_1_159_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(67)80003-6"},{"key":"e_1_2_1_160_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-21.2.98"},{"key":"e_1_2_1_161_2","volume-title":"Recent Progress in Combinatorics","author":"Tutte W. T.","year":"1969"},{"key":"e_1_2_1_162_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90165-6"},{"key":"e_1_2_1_163_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90196-6"},{"key":"e_1_2_1_164_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(84)90010-4"},{"key":"e_1_2_1_165_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(77)90072-7"},{"key":"e_1_2_1_166_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(76)90051-4"},{"key":"e_1_2_1_167_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(82)90080-6"},{"key":"e_1_2_1_168_2","first-page":"89","article-title":"Hamiltonian\u2010connectedness of line graphs","volume":"22","author":"Zhan S.","year":"1986","journal-title":"Ars Combinat."},{"key":"e_1_2_1_169_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190120211"},{"key":"e_1_2_1_170_2","first-page":"237","volume-title":"Graphs (Burnaby, B. C., 1982), North Holland Mathematics Studies","author":"Zhu Y. J.","year":"1985"},{"key":"e_1_2_1_171_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(83)90052-7"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190150204","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190150204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T04:42:53Z","timestamp":1698036173000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190150204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":170,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["10.1002\/jgt.3190150204"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190150204","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}