{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:52Z","timestamp":1740107152737,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T00:00:00Z","timestamp":1570233600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T00:00:00Z","timestamp":1570233600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s00373-019-02101-7","type":"journal-article","created":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T14:09:31Z","timestamp":1570284571000},"page":"387-400","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Counting Hamiltonian Cycles on Quartic 4-Vertex-Connected Planar Graphs"],"prefix":"10.1007","volume":"36","author":[{"given":"Robert D.","family":"Barish","sequence":"first","affiliation":[]},{"given":"Akira","family":"Suyama","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,5]]},"reference":[{"issue":"3","key":"2101_CR1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1002\/jgt.20290","volume":"57","author":"REL Aldred","year":"2007","unstructured":"Aldred, R.E.L., Thomassen, C.: On the maximum number of cycles in a planar graph. J. Graph Theory 57(3), 255\u2013264 (2007)","journal-title":"J. Graph Theory"},{"key":"2101_CR2","unstructured":"Barish, R.D., Suyama, A.: Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs. In: Online collection of abstracts for the 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG3), pp. 129\u2013130. \nhttp:\/\/www.jcdcgg.u-tokai.ac.jp\/\n\n (2017). Accessed 30 Sept 2017"},{"key":"2101_CR3","unstructured":"Barish, R. D.: Personal communication (2017)"},{"issue":"2","key":"2101_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1006\/jctb.1998.1845","volume":"74","author":"JA Bondy","year":"1998","unstructured":"Bondy, J.A., Jackson, B.: Vertices of small degree in uniquely Hamiltonian graphs. J. Combin. Theory Ser. B 74(2), 265\u2013275 (1998)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2101_CR5","doi-asserted-by":"crossref","unstructured":"Briquel, I., Koiran, P.: A dichotomy theorem for polynomial evaluation. In: Proceedings of the 34th annual symposium on Mathematical Foundations of Computer Science (MFCS), pp. 187\u2013198 (2009)","DOI":"10.1007\/978-3-642-03816-7_17"},{"issue":"2","key":"2101_CR6","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0196-6774(89)90012-6","volume":"10","author":"N Chiba","year":"1989","unstructured":"Chiba, N., Nishizeki, T.: The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs. J. Algorithms 10(2), 187\u2013211 (1989)","journal-title":"J. Algorithms"},{"issue":"3","key":"2101_CR7","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s00453-003-1073-y","volume":"38","author":"M Dyer","year":"2004","unstructured":"Dyer, M., Goldberg, L.A., Greenhill, C., Jerrum, M.: The relative complexity of approximate counting problems. Algorithmica 38(3), 471\u2013500 (2004)","journal-title":"Algorithmica"},{"issue":"2","key":"2101_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/jgt.21729","volume":"75","author":"H Fleischner","year":"2014","unstructured":"Fleischner, H.: Uniquely Hamiltonian graphs of minimum degree 4. J. Graph Theory 75(2), 167\u2013177 (2014)","journal-title":"J. Graph Theory"},{"issue":"3","key":"2101_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1(3), 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"2101_CR10","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. Comput. 5(4), 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"key":"2101_CR11","doi-asserted-by":"crossref","unstructured":"Karp, R. M., Luby, M.: Monte-Carlo algorithms for enumeration and reliability problems. In: Proceedings of the 24th Annual Symposium on Foundations of Computer Science (FOCS), pp. 56\u201364 (1983)","DOI":"10.1109\/SFCS.1983.35"},{"issue":"1\u20133","key":"2101_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0304-3975(03)00080-X","volume":"304","author":"M Li\u015bkiewicz","year":"2003","unstructured":"Li\u015bkiewicz, M., Ogihara, M., Toda, S.: The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. Theor. Comput. Sci. 304(1\u20133), 129\u2013156 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"2101_CR13","doi-asserted-by":"publisher","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K Menger","year":"1927","unstructured":"Menger, K.: Zur allgemeinen kurventheorie. Fundamenta Mathematicae 10(1), 96\u2013115 (1927)","journal-title":"Fundamenta Mathematicae"},{"issue":"1","key":"2101_CR14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0095-8956(73)80006-1","volume":"14","author":"GHJ Meredith","year":"1973","unstructured":"Meredith, G.H.J.: Regular n-valent n-connected nonHamiltonian non-n-edge-colorable graphs. J. Combin. Theory Ser. B 14(1), 55\u201360 (1973)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2101_CR15","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J Petersen","year":"1891","unstructured":"Petersen, J.: Die theorie der regul\u00e4ren graphs. Acta Math. 15, 193\u2013220 (1891)","journal-title":"Acta Math."},{"key":"2101_CR16","unstructured":"Sheehan, J.: The multiplicity of Hamiltonian circuits in a graph. In: Recent Advances in Graph Theory. Proceedings of the 2nd Czechoslovak Symposium, Prague, 1974, pp. 477\u2013480 (1975)"},{"issue":"part 1.2, B)","key":"2101_CR17","first-page":"1","volume":"3","author":"E Steinitz","year":"1922","unstructured":"Steinitz, E.: Polyeder und raumeinteilungen. Encyklop\u00e4die der mathematischen Wissenschaften 3(part 1.2, B)), 1\u2013139 (1922)","journal-title":"Encyklop\u00e4die der mathematischen Wissenschaften"},{"key":"2101_CR18","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1080\/14786448408627475","volume":"17","author":"PG Tait","year":"1884","unstructured":"Tait, P.G.: Listing\u2019s topologie. Philosophical Magazine (5th ser.) 17, 30\u201346 (1884)","journal-title":"Philosophical Magazine (5th ser.)"},{"key":"2101_CR19","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1002\/jgt.3190070205","volume":"7","author":"C Thomassen","year":"1983","unstructured":"Thomassen, C.: A theorem on paths in planar graphs. J. Graph Theory 7, 169\u2013176 (1983)","journal-title":"J. Graph Theory"},{"key":"2101_CR20","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1112\/jlms\/s1-21.2.98","volume":"21","author":"WT Tutte","year":"1946","unstructured":"Tutte, W.T.: On Hamiltonian circuits. J. Lond. Math. Soc. 21, 98\u2013101 (1946)","journal-title":"J. Lond. Math. Soc."},{"key":"2101_CR21","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1090\/S0002-9947-1956-0081471-8","volume":"82","author":"WT Tutte","year":"1956","unstructured":"Tutte, W.T.: A theorem on planar graphs. Trans. Am. Math. Soc. 82, 99\u2013116 (1956)","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"2101_CR22","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theor. Comput. Sci. 8(2), 189\u2013201 (1979)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"2101_CR23","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"2101_CR24","doi-asserted-by":"publisher","first-page":"378","DOI":"10.2307\/1968197","volume":"32","author":"H Whitney","year":"1931","unstructured":"Whitney, H.: A theorem on graphs. Ann. Math. 32(2), 378\u2013390 (1931)","journal-title":"Ann. Math."},{"issue":"1","key":"2101_CR25","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1142\/S0129054191000066","volume":"2","author":"V Zanko","year":"1991","unstructured":"Zanko, V.: $$\\#P$$-completeness via many-one reductions. Int. J. Found. Comput. Sci. 2(1), 77\u201382 (1991)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"6","key":"2101_CR26","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1137\/S0097539794266407","volume":"25","author":"D Zuckerman","year":"1996","unstructured":"Zuckerman, D.: On unapproximable versions of NP-complete problems. SIAM J. Comput. 25(6), 1293\u20131304 (1996)","journal-title":"SIAM J. Comput."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02101-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02101-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02101-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,3]],"date-time":"2020-10-03T23:19:47Z","timestamp":1601767187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02101-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,5]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["2101"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02101-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2019,10,5]]},"assertion":[{"value":"6 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}