{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:42Z","timestamp":1725490242038},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642317699"},{"type":"electronic","value":"9783642317705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31770-5_8","type":"book-chapter","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T01:03:12Z","timestamp":1343264592000},"page":"83-94","source":"Crossref","is-referenced-by-count":0,"title":["Hamiltonian Paths and Cycles in Planar Graphs"],"prefix":"10.1007","author":[{"given":"Sudip","family":"Biswas","sequence":"first","affiliation":[]},{"given":"Stephane","family":"Durocher","sequence":"additional","affiliation":[]},{"given":"Debajyoti","family":"Mondal","sequence":"additional","affiliation":[]},{"given":"Rahnuma Islam","family":"Nishat","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"8_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(4), 203\u2013207 (1993)","journal-title":"Information Processing Letters"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-73545-8_12","volume-title":"Computing and Combinatorics","author":"K. Buchin","year":"2007","unstructured":"Buchin, K., Knauer, C., Kriegel, K., Schulz, A., Seidel, R.: On the Number of Cycles in Planar Graphs. In: Lin, G. (ed.) COCOON 2007. LNCS, vol.\u00a04598, pp. 97\u2013107. Springer, Heidelberg (2007)"},{"issue":"1-3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0012-365X(95)00330-Y","volume":"169","author":"K.L. Collins","year":"1997","unstructured":"Collins, K.L., Krompart, L.B.: The number of Hamiltonian paths in a rectangular grid. Discrete Mathematics\u00a0169(1-3), 29\u201338 (1997)","journal-title":"Discrete Mathematics"},{"issue":"1-3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(95)00072-5","volume":"156","author":"S.J. Curran","year":"1996","unstructured":"Curran, S.J., Gallian, J.A.: Hamiltonian cycles and paths in Cayley graphs and digraphs - A survey. Discrete Mathematics\u00a0156(1-3), 1\u201318 (1996)","journal-title":"Discrete Mathematics"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.endm.2009.07.081","volume":"34","author":"A. Mier de","year":"2009","unstructured":"de Mier, A., Noy, M.: On the maximum number of cycles in outerplanar and series-parallel graphs. Electronic Notes in Discrete Mathematics\u00a034, 489\u2013493 (2009)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","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(1), 61\u201381 (2007)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"8_CR7","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company (1979)"},{"issue":"35","key":"8_CR8","doi-asserted-by":"publisher","first-page":"4579","DOI":"10.1016\/j.tcs.2011.04.038","volume":"412","author":"H. Gebauer","year":"2011","unstructured":"Gebauer, H.: Finding and enumerating Hamilton cycles in 4-regular graphs. Theoretical Computer Science\u00a0412(35), 4579\u20134591 (2011)","journal-title":"Theoretical Computer Science"},{"key":"8_CR9","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-642-17511-4_22","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"R. Pichler","year":"2010","unstructured":"Pichler, R., R\u00fcmmele, S., Woltran, S.: Counting and Enumeration Problems with Bounded Treewidth. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. LNCS (LNAI), vol.\u00a06355, pp. 387\u2013404. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31770-5_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:47:52Z","timestamp":1620114472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31770-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642317699","9783642317705"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31770-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}