{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:06Z","timestamp":1759639086149},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662460771"},{"type":"electronic","value":"9783662460788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46078-8_27","type":"book-chapter","created":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T09:54:29Z","timestamp":1421229269000},"page":"327-338","source":"Crossref","is-referenced-by-count":2,"title":["Nash-Williams-type and Chv\u00e1tal-type Conditions in One-Conflict Graphs"],"prefix":"10.1007","author":[{"given":"Christian","family":"Laforest","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"Mom\u00e8ge","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer London Ltd. (2010)"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0095-8956(72)90020-2","volume":"12","author":"V. Chv\u00e1tal","year":"1972","unstructured":"Chv\u00e1tal, V.: On hamilton\u2019s ideals. J. Combinatorial Theory (B)\u00a012, 163\u2013168 (1972)","journal-title":"J. Combinatorial Theory (B)"},{"key":"27_CR3","doi-asserted-by":"publisher","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. London Math. Soc.\u00a02, 69\u201381 (1952)","journal-title":"Proc. London Math. Soc."},{"issue":"1","key":"27_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 Mathematics\u00a0309(1), 104\u2013112 (2009)","journal-title":"Discrete Mathematics"},{"key":"27_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":"M.M. 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.\u00a07741, pp. 257\u2013267. Springer, Heidelberg (2013)"},{"key":"27_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":"M.M. 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.\u00a07876, pp. 343\u2013354. Springer, Heidelberg (2013)"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Laforest, C., Mom\u00e8ge, B.: Hamiltonian conditions in one-conflict graphs. Accepted at IWOCA (2014)","DOI":"10.1007\/978-3-319-19315-1_23"},{"issue":"19","key":"27_CR8","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 Mathematics\u00a0313(19), 2034\u20132053 (2013)","journal-title":"Discrete Mathematics"},{"key":"27_CR9","unstructured":"Nash-Williams, C.St.J.A.: Valency sequences which force graphs to have hamiltonian circuits. In: University of Waterloo Research Report. Waterloo, Ontario: University of Waterloo (1969)"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Ore, \u00d8.: Note on Hamiltonian circuits. American Mathematical Monthly\u00a0(67), 55 (1960)","DOI":"10.2307\/2308928"},{"issue":"2-3","key":"27_CR11","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 Applied Mathematics\u00a0126(2-3), 261\u2013273 (2003)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2015: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46078-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T00:00:23Z","timestamp":1559088023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46078-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662460771","9783662460788"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46078-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}