{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T15:00:26Z","timestamp":1781276426761,"version":"3.54.1"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP250101611"],"award-info":[{"award-number":["DP250101611"]}],"id":[{"id":"10.13039\/501100000923","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":[[2026,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We prove that an inseparable graph can have any positive number of cycles with the six exceptions 2, 4, 5, 8, 9, 16, and that an inseparable cubic graph has the additional exceptions 1 and 13. The exceptions for simple inseparable cubic graphs are unknown.<\/jats:p>","DOI":"10.1007\/s00373-026-03047-3","type":"journal-article","created":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T11:21:07Z","timestamp":1780312867000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Cycle Counts of Graphs"],"prefix":"10.1007","volume":"42","author":[{"given":"Ryan","family":"McCulloch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brendan D.","family":"McKay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alireza","family":"Salahshoori","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0851-7963","authenticated-orcid":false,"given":"Thomas","family":"Zaslavsky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,1]]},"reference":[{"key":"3047_CR1","doi-asserted-by":"crossref","unstructured":"Brinkmann, G., Goedgebeur, J., McKay, B.D.: Generation of cubic graphs. Discrete Math. Theor. Comput. Sci. 13, 69\u201380 (2011). Software available at https:\/\/caagt.ugent.be\/cubic\/","DOI":"10.46298\/dmtcs.551"},{"key":"3047_CR2","unstructured":"Brinkmann, G., McKay, B.D.: Fast generation of planar graphs. MATCH Commun. Math. Comput. Chem. 58, 323\u2013357 (2007). Software available at https:\/\/users.cecs.anu.edu.au\/~bdm\/plantri\/"},{"key":"3047_CR3","doi-asserted-by":"publisher","first-page":"3314","DOI":"10.1016\/j.dam.2009.07.004","volume":"157","author":"\u00c9 Czabarka","year":"2009","unstructured":"Czabarka, \u00c9., Sz\u00e9kely, L., Wagner, S.: The inverse problem for certain tree parameters. Discrete Appl. Math. 157, 3314\u20133319 (2009)","journal-title":"Discrete Appl. Math."},{"key":"3047_CR4","unstructured":"McKay, B.D.: Graphs with given cycle counts, internet resource, https:\/\/users.cecs.anu.edu.au\/~bdm\/data\/graphs.html"},{"key":"3047_CR5","doi-asserted-by":"crossref","unstructured":"McKay, B.D., Piperno, A.: Practical Graph Isomorphism, II. J. Symbolic Comput. 60, 94\u2013112 (2014). Software available at https:\/\/users.cecs.anu.edu.au\/~bdm\/nauty\/","DOI":"10.1016\/j.jsc.2013.09.003"},{"key":"3047_CR6","unstructured":"OEIS Foundation, Online Encyclopedia of Integer Sequences (2025). https:\/\/oeis.org"},{"issue":"2","key":"3047_CR7","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1090\/S0002-9947-1932-1501641-2","volume":"34","author":"H Whitney","year":"1932","unstructured":"Whitney, H.: Non-separable and planar graphs. Trans. Amer. Math. Soc. 34(2), 339\u2013362 (1932)","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03047-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-026-03047-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03047-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T14:26:28Z","timestamp":1781274388000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-026-03047-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["3047"],"URL":"https:\/\/doi.org\/10.1007\/s00373-026-03047-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"7 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2026","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.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"53"}}