{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:04Z","timestamp":1725455584556},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637578"},{"type":"electronic","value":"9783540696438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0024486","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T02:30:56Z","timestamp":1132367456000},"page":"38-51","source":"Crossref","is-referenced-by-count":0,"title":["Pseudo-hamiltonian graphs"],"prefix":"10.1007","author":[{"given":"Luitpold","family":"Babel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12 (1991) 308\u2013340","journal-title":"J. Algorithms"},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0012-365X(78)90107-3","volume":"23","author":"C. Berge","year":"1978","unstructured":"Berge, C.: Regularizable graphs I. Discrete Mathematics 23 (1978) 85\u201389","journal-title":"Discrete Mathematics"},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0012-365X(78)90108-5","volume":"23","author":"C. Berge","year":"1978","unstructured":"Berge, C.: Regularizable graphs II. Discrete Mathematics 23 (1978) 91\u201395","journal-title":"Discrete Mathematics"},{"key":"5_CR4","first-page":"116","volume":"36","author":"H.L. Bodlaender","year":"1988","unstructured":"Bodlaender, H.L.: Some classes of graphs with bounded treewidth. Bulletin off the EATCS 36 (1988) 116\u2013126","journal-title":"Bulletin off the EATCS"},{"key":"5_CR5","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 Mathematics 5 (1973) 215\u2013228","journal-title":"Discrete Mathematics"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science WG'93, Springer Verlag, LNCS 790, 1994, 211\u2013224","DOI":"10.1007\/3-540-57899-4_54"},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1137\/S0097539791200375","volume":"23","author":"J.S. Deogun","year":"1994","unstructured":"Deogun, J.S., Steiner, G.: Polynomial algorithms for hamiltonian cycles in cocomparability graphs. SIAM J. Computing 23 (1994) 520\u2013552","journal-title":"SIAM J. Computing"},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0095-8956(74)90091-4","volume":"16","author":"H. Fleischner","year":"1974","unstructured":"Fleischner, H.: The square of every two-connected graph is hamiltonian. J. Combinatorial Theory B 16 (1974) 29\u201334","journal-title":"J. Combinatorial Theory B"},{"key":"5_CR9","volume-title":"Computers and intractability, A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability, A guide to the theory of NP-completeness. Freeman, San Francisco, 1979"},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","volume":"6","author":"D.S. Johnson","year":"1985","unstructured":"Johnson, D.S.: The NP-completeness column: an ongoing guide. J. Algorithms 6 (1985) 434\u2013451","journal-title":"J. Algorithms"},{"key":"5_CR11","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching theory. Annals of Discrete Math. 29, North-Holland, 1986"},{"key":"5_CR12","first-page":"527","volume-title":"Handbook of Theoretical Computer Science, A: Algorithms and Complexity Theory","author":"J. Leeuwen van","year":"1990","unstructured":"van Leeuwen, J.: Graph algorithms, in: Handbook of Theoretical Computer Science, A: Algorithms and Complexity Theory, 527\u2013631, North Holland, Amsterdam, 1990"}],"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\/BFb0024486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T17:18:38Z","timestamp":1549300718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637578","9783540696438"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0024486","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}