{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T00:12:11Z","timestamp":1704327131335},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T00:00:00Z","timestamp":1691712000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T00:00:00Z","timestamp":1691712000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s00453-023-01162-8","type":"journal-article","created":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T07:02:25Z","timestamp":1691737345000},"page":"194-217","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Refined Bounds on the Number of Eulerian Tours in Undirected Graphs"],"prefix":"10.1007","volume":"86","author":[{"given":"Giulia","family":"Punzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessio","family":"Conte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,11]]},"reference":[{"key":"1162_CR2","unstructured":"Euler, L.: Solutio problematis ad geometriam situs pertinentis. Commentarii Academiae Scientiarum Imperialis Petropolitanae 8, 128\u2013140 (1736)"},{"issue":"1","key":"1162_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0012-365X(00)00067-4","volume":"230","author":"H Fleischner","year":"2001","unstructured":"Fleischner, H.: (Some of) the many uses of Eulerian graphs in graph theory (plus some applications). Discret. Math. 230(1), 23\u201343 (2001)","journal-title":"Discret. Math."},{"issue":"17","key":"1162_CR4","doi-asserted-by":"publisher","first-page":"9748","DOI":"10.1073\/pnas.171285098","volume":"98","author":"PA Pevzner","year":"2001","unstructured":"Pevzner, P.A., Tang, H., Waterman, M.S.: An Eulerian path approach to DNA fragment assembly. Proc. Nat. Acad. Sci. 98(17), 9748\u20139753 (2001)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"1","key":"1162_CR5","first-page":"23","volume":"19","author":"J-I Sohn","year":"2018","unstructured":"Sohn, J.-I., Nam, J.-W.: The present and future of de novo whole-genome assembly. Brief. Bioinform. 19(1), 23\u201340 (2018)","journal-title":"Brief. Bioinform."},{"key":"1162_CR6","doi-asserted-by":"crossref","unstructured":"Bernardini, G., Chen, H., Fici, G., Loukides, G., Pissis, S.P.: Reverse-safe data structures for text indexing. In: Proceedings of the symposium on algorithm engineering and experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020, pp. 199\u2013213 (2020)","DOI":"10.1137\/1.9781611976007.16"},{"issue":"1","key":"1162_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0166-218X(87)90045-X","volume":"18","author":"SW Bent","year":"1987","unstructured":"Bent, S.W., Manber, U.: On non-intersecting Eulerian circuits. Discret. Appl. Math. 18(1), 87\u201394 (1987)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"1162_CR8","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BF01442866","volume":"6","author":"C Hierholzer","year":"1873","unstructured":"Hierholzer, C., Wiener, C.: \u00dcber die m\u00f6glichkeit, einen linienzug ohne wiederholung und ohne unterbrechung zu umfahren. Math. Ann. 6(1), 30\u201332 (1873)","journal-title":"Math. Ann."},{"key":"1162_CR9","doi-asserted-by":"crossref","unstructured":"van Aardenne-Ehrenfest, T., de Bruijn, N.G.: In: Gessel, I., Rota, G.-C. (eds.) Circuits and Trees in Oriented Linear Graphs, pp. 149\u2013163. Birkh\u00e4user Boston, Boston, MA (1987)","DOI":"10.1007\/978-0-8176-4842-8_12"},{"key":"1162_CR10","unstructured":"Brightwell, G.R., Winkler, P.: Counting Eulerian circuits is #P-complete. In: ALENEX\/ANALCO, pp. 259\u2013262 (2005). ACM SIAM"},{"key":"1162_CR11","unstructured":"Creed, P.J.: Counting and sampling problems on Eulerian graphs. PhD thesis, University of Edinburgh (2010)"},{"issue":"3","key":"1162_CR12","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1007\/s00453-010-9463-4","volume":"63","author":"Q Ge","year":"2012","unstructured":"Ge, Q., \u0160tefankovi\u010d, D.: The complexity of counting Eulerian tours in 4-regular graphs. Algorithmica 63(3), 588\u2013601 (2012)","journal-title":"Algorithmica"},{"issue":"4\/5","key":"1162_CR13","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/BF01940872","volume":"16","author":"M Mihail","year":"1996","unstructured":"Mihail, M., Winkler, P.: On the number of Eulerian orientations of a graph. Algorithmica 16(4\/5), 402\u2013414 (1996)","journal-title":"Algorithmica"},{"issue":"3","key":"1162_CR14","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF02579193","volume":"3","author":"A Schrijver","year":"1983","unstructured":"Schrijver, A.: Bounds on the number of Eulerian orientations. Combinatorica 3(3), 375\u2013380 (1983)","journal-title":"Combinatorica"},{"key":"1162_CR15","doi-asserted-by":"crossref","unstructured":"Las Vergnas, M.: Le polyn\u00f4me de Martin d\u2019un graphe eulerien. In: Berge, C., Bresson, D., Camion, P., Maurras, J.F., Sterboul, F. (eds.) Combinatorial Mathematics. North-Holland Mathematics Studies, vol. 75, pp. 397\u2013411. North-Holland, (1983)","DOI":"10.1016\/S0304-0208(08)73415-7"},{"issue":"1","key":"1162_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF02122696","volume":"10","author":"M Las Vergnas","year":"1990","unstructured":"Las Vergnas, M.: An upper bound for the number of Eulerian orientations of a regular graph. Combinatorica 10(1), 61\u201365 (1990)","journal-title":"Combinatorica"},{"key":"1162_CR17","doi-asserted-by":"crossref","unstructured":"Conte, A., Grossi, R., Loukides, G., Pisanti, N., Pissis, S.P., Punzi, G.: Beyond the BEST theorem: Fast assessment of Eulerian trails. In: International symposium on fundamentals of computation theory, pp. 162\u2013175 (2021). Springer","DOI":"10.1007\/978-3-030-86593-1_11"},{"key":"1162_CR1","doi-asserted-by":"crossref","unstructured":"Punzi, G.: Bounding the number of Eulerian tours in undirected graphs. In: Computing and combinatorics: 28th international conference, COCOON 2022, Shenzhen, China, October 22\u201324, 2022, Proceedings, pp. 368\u2013380 (2023). Springer","DOI":"10.1007\/978-3-031-22105-7_33"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01162-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-023-01162-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01162-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,3]],"date-time":"2024-01-03T17:04:11Z","timestamp":1704301451000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-023-01162-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,11]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["1162"],"URL":"https:\/\/doi.org\/10.1007\/s00453-023-01162-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,11]]},"assertion":[{"value":"31 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}