{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:10:53Z","timestamp":1725541853100},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114083"},{"type":"electronic","value":"9783642114090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11409-0_4","type":"book-chapter","created":{"date-parts":[[2009,12,3]],"date-time":"2009-12-03T08:12:27Z","timestamp":1259827947000},"page":"44-53","source":"Crossref","is-referenced-by-count":3,"title":["Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs"],"prefix":"10.1007","author":[{"given":"Hajo","family":"Broersma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fedor V.","family":"Fomin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pim","family":"van \u2019t Hof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0020-0190(93)90033-6","volume":"47","author":"E.T. Bax","year":"1993","unstructured":"Bax, E.T.: Inclusion and exclusion algorithm for the Hamiltonian path problem. Information Processing Letters\u00a047, 203\u2013207 (1993)","journal-title":"Information Processing Letters"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-540-70575-8_17","volume-title":"Automata, Languages and Programming","author":"A. Bj\u00f6rklund","year":"2008","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: The travelling salesman problem in bounded degree graphs. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 198\u2013209. Springer, Heidelberg (2008)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-540-85238-4_15","volume-title":"Mathematical Foundations of Computer Science 2008","author":"H.J. Broersma","year":"2008","unstructured":"Broersma, H.J., Paulusma, D.: Computing sharp 2-factors in claw-free graphs. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 193\u2013204. Springer, Heidelberg (2008)"},{"key":"4_CR4","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory, 2nd edn. Graduate Texts in Mathematics, vol.\u00a0173. Springer, Heidelberg (2000)","edition":"2"},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.7155\/jgaa.00137","volume":"11","author":"D. Eppstein","year":"2007","unstructured":"Eppstein, D.: The traveling salesman problem for cubic graphs. Journal of Graph Algorithms and Applications\u00a011, 61\u201381 (2007)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0012-365X(96)00045-3","volume":"164","author":"R. Faudree","year":"1997","unstructured":"Faudree, R., Flandrin, E., Ryj\u00e1\u010dek, Z.: Claw-free graphs\u2014a survey. Discrete Mathematics\u00a0164, 87\u2013147 (1997)","journal-title":"Discrete Mathematics"},{"key":"4_CR7","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H.\u00a0Freeman and Co., New York (1979)"},{"key":"4_CR8","volume-title":"4th Workshop on Analytic and Combinatorics (ANALCO 2008)","author":"H. Gebauer","year":"2008","unstructured":"Gebauer, H.: On the number of hamilton cycles in bounded degree graphs. In: 4th Workshop on Analytic and Combinatorics (ANALCO 2008), SIAM, Philadelphia (2008)"},{"key":"4_CR9","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)"},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"701","DOI":"10.4153\/CMB-1965-051-3","volume":"8","author":"F. Harary","year":"1965","unstructured":"Harary, F., Nash-Williams, C.S.J.A.: On eulerian and hamiltonian graphs and line graphs. Canadian Mathematical Bulletin\u00a08, 701\u2013709 (1965)","journal-title":"Canadian Mathematical Bulletin"},{"key":"4_CR11","first-page":"196","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. Journal of SIAM\u00a010, 196\u2013210 (1962)","journal-title":"Journal of SIAM"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-73545-8_13","volume-title":"Computing and Combinatorics","author":"K. Iwama","year":"2007","unstructured":"Iwama, K., Nakashima, T.: An improved exact algorithm for cubic graph TSP. In: Lin, G. (ed.) COCOON 2007. LNCS, vol.\u00a04598, pp. 108\u2013117. Springer, Heidelberg (2007)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0167-6377(82)90044-X","volume":"1","author":"R.M. Karp","year":"1982","unstructured":"Karp, R.M.: Dynamic programming meets the principle of inclusion and exclusion. Operations Research Letters\u00a01, 49\u201351 (1982)","journal-title":"Operations Research Letters"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0166-218X(99)00163-8","volume":"98","author":"M. Li","year":"2000","unstructured":"Li, M., Corneil, D.G., Mendelsohn, E.: Pancyclicity and NP-completeness in planar graphs. Discrete Applied Mathematics\u00a098, 219\u2013225 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(95)00057-4","volume":"156","author":"H. M\u00fcller","year":"1996","unstructured":"M\u00fcller, H.: Hamiltonian circuits in chordal bipartite graphs. Discrete Mathematics\u00a0156, 291\u2013298 (1996)","journal-title":"Discrete Mathematics"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/0020-0190(73)90029-X","volume":"2","author":"N.D. Roussopoulos","year":"1973","unstructured":"Roussopoulos, N.D.: A max {m,n} algorithm for determining the graph H from its line graph G. Information Processing Letters\u00a02, 108\u2013112 (1973)","journal-title":"Information Processing Letters"},{"key":"4_CR17","doi-asserted-by":"publisher","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. Journal of Combinatorial Theory, series B\u00a070, 217\u2013224 (1997)","journal-title":"Journal of Combinatorial Theory, series B"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0095-8956(81)80025-1","volume":"31","author":"C. Thomassen","year":"1981","unstructured":"Thomassen, C., Toft, B.: Non-separating induced cycles in graphs. Journal of Combinatorial Theory, Series B\u00a031, 199\u2013224 (1981)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.dam.2007.03.023","volume":"156","author":"G.J. Woeginger","year":"2008","unstructured":"Woeginger, G.J.: Open problems around exact algorithms. Discrete Applied Mathematics\u00a0156, 397\u2013405 (2008)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11409-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,10]],"date-time":"2019-03-10T17:05:02Z","timestamp":1552237502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11409-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114083","9783642114090"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11409-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}