{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:45Z","timestamp":1759638525044,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319193144"},{"type":"electronic","value":"9783319193151"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19315-1_23","type":"book-chapter","created":{"date-parts":[[2015,6,6]],"date-time":"2015-06-06T10:42:08Z","timestamp":1433587328000},"page":"262-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Some Hamiltonian Properties of One-Conflict Graphs"],"prefix":"10.1007","author":[{"given":"Christian","family":"Laforest","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"Mom\u00e8ge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,7]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0012-365X(76)90078-9","volume":"15","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Chv\u00e1tal, V.: A method in graph theory. Discrete Math. 15, 111\u2013135 (1976)","journal-title":"Discrete Math."},{"key":"23_CR2","volume-title":"Graph Theory","author":"JA Bondy","year":"2010","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, London Ltd (2010)"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"GA Dirac","year":"1952","unstructured":"Dirac, G.A.: Some theorems on abstract graphs. Proc. London Math. Soc. 2, 69\u201381 (1952)","journal-title":"Proc. London Math. Soc."},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.disc.2007.12.050","volume":"309","author":"Z Dvo\u0159\u00e1k","year":"2009","unstructured":"Dvo\u0159\u00e1k, Z.: Two-factors in orientated graphs with forbidden transitions. Discrete Math. 309(1), 104\u2013112 (2009)","journal-title":"Discrete Math."},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-35843-2_23","volume-title":"SOFSEM 2013: Theory and Practice of Computer Science","author":"MM Kant\u00e9","year":"2013","unstructured":"Kant\u00e9, M.M., Laforest, C., Mom\u00e8ge, B.: An exact algorithm to check the existence of (elementary) paths and a generalisation of the cut problem in graphs with forbidden transitions. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol. 7741, pp. 257\u2013267. Springer, Heidelberg (2013)"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-38236-9_31","volume-title":"Theory and Applications of Models of Computation","author":"MM Kant\u00e9","year":"2013","unstructured":"Kant\u00e9, M.M., Laforest, C., Mom\u00e8ge, B.: Trees in graphs with conflict edges or forbidden transitions. In: Chan, T.-H.H., Lau, L.C., Trevisan, L. (eds.) TAMC 2013. LNCS, vol. 7876, pp. 343\u2013354. Springer, Heidelberg (2013)"},{"issue":"19","key":"23_CR7","doi-asserted-by":"publisher","first-page":"2034","DOI":"10.1016\/j.disc.2012.11.025","volume":"313","author":"H Li","year":"2013","unstructured":"Li, H.: Generalizations of Dirac\u2019s theorem in hamiltonian graph theory - a survey. Discrete Math. 313(19), 2034\u20132053 (2013)","journal-title":"Discrete Math."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.2307\/2308928","volume":"67","author":"\u00d8 Ore","year":"1960","unstructured":"Ore, \u00d8.: Note on Hamiltonian circuits. Am. Math. Mon. 67, 55 (1960)","journal-title":"Am. Math. Mon."},{"issue":"2\u20133","key":"23_CR9","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0166-218X(02)00251-2","volume":"126","author":"S Szeider","year":"2003","unstructured":"Szeider, S.: Finding paths in graphs avoiding forbidden transitions. Discrete Appl. Math. 126(2\u20133), 261\u2013273 (2003)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19315-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T08:24:38Z","timestamp":1676017478000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19315-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319193144","9783319193151"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19315-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"7 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}