{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:44Z","timestamp":1740107144143,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,4,5]],"date-time":"2018-04-05T00:00:00Z","timestamp":1522886400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["523748"],"award-info":[{"award-number":["523748"]}],"id":[{"id":"10.13039\/100000893","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":[[2018,7]]},"DOI":"10.1007\/s00373-018-1891-y","type":"journal-article","created":{"date-parts":[[2018,4,5]],"date-time":"2018-04-05T07:51:02Z","timestamp":1522914662000},"page":"523-534","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Graph Bases and Diagram Commutativity"],"prefix":"10.1007","volume":"34","author":[{"given":"Richard H.","family":"Hammack","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul C.","family":"Kainen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,5]]},"reference":[{"key":"1891_CR1","volume-title":"Graph Theory, Graduate Texts in Mathematics, vol. 173","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, Graduate Texts in Mathematics, vol. 173, 3rd edn. Springer, Berlin (2005)","edition":"3"},{"key":"1891_CR2","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/net.3230060206","volume":"6","author":"ET Dixon","year":"1976","unstructured":"Dixon, E.T., Goodman, S.E.: An algorithm for the longest cycle problem. Networks 6, 139\u2013146 (1976)","journal-title":"Networks"},{"key":"1891_CR3","unstructured":"Eppstein, D.: StackExchange, April 20, 2015 (on-line discussion). http:\/\/cstheory.stackexchange.com\/questions\/31203\/what-is-the-best-way-to-find-an-induced-cycle-basis-of-a-graph"},{"issue":"2","key":"1891_CR4","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1002\/(SICI)1097-0118(199610)23:2<175::AID-JGT8>3.0.CO;2-Q","volume":"23","author":"A Galluccio","year":"1996","unstructured":"Galluccio, A., Loebl, M.: $$(p, q)$$ ( p , q ) -odd digraphs. J. Graph Theory 23(2), 175\u2013184 (1996)","journal-title":"J. Graph Theory"},{"key":"1891_CR5","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.dam.2017.10.001","volume":"235","author":"RH Hammack","year":"2018","unstructured":"Hammack, R.H., Kainen, P.C.: Robust cycle bases do not exist for $$K_{n, n}$$ K n , n if $$n \\ge 8$$ n \u2265 8 . Discrete Appl. Math. 235, 206\u2013211 (2018)","journal-title":"Discrete Appl. Math."},{"key":"1891_CR6","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)"},{"key":"1891_CR7","doi-asserted-by":"crossref","unstructured":"Kainen, P.C.: On robust cycle bases. Electron. Notes Discret. Math. 11, 430\u2013437 (2002) [Proc. 9th Quadr.\u00a0Conf. on Graph Theory, Comb., Algorithms and Appl., ed. by Y. Alavi et al., 2000)]","DOI":"10.1016\/S1571-0653(04)00087-3"},{"issue":"3","key":"1891_CR8","first-page":"213","volume":"43","author":"PC Kainen","year":"2002","unstructured":"Kainen, P.C.: Isolated squares in hypercubes and robustness of commutativity. Cahiers de topologie et g\u00e9om.\u00a0diff.\u00a0cat\u00e9g 43(3), 213\u2013220 (2002)","journal-title":"Cahiers de topologie et g\u00e9om.\u00a0diff.\u00a0cat\u00e9g"},{"key":"1891_CR9","unstructured":"Kainen, P.C.: Graph cycles and diagram commutativity. Diagrammes 67\u201368, 177\u2013238 (2012) (Supplem.)"},{"issue":"1","key":"1891_CR10","doi-asserted-by":"crossref","first-page":"27","DOI":"10.26493\/1855-3974.450.0b6","volume":"9","author":"PC Kainen","year":"2015","unstructured":"Kainen, P.C.: Cycle construction and geodesic cycles with application to the hypercube. Ars Math. Contemp. 9(1), 27\u201343 (2015)","journal-title":"Ars Math. Contemp."},{"key":"1891_CR11","doi-asserted-by":"publisher","first-page":"025101(R)","DOI":"10.1103\/PhysRevE.73.025101","volume":"73","author":"K Klemm","year":"2006","unstructured":"Klemm, K., Stadler, P.F.: Statistics of cycles in large networks. Phys. Rev. E 73, 025101(R) (2006)","journal-title":"Phys. Rev. E"},{"key":"1891_CR12","doi-asserted-by":"publisher","first-page":"2432","DOI":"10.1016\/j.dam.2008.06.047","volume":"157","author":"K Klemm","year":"2009","unstructured":"Klemm, K., Stadler, P.F.: A note on fundamental, non-fundamental, and robust cycle bases. Discrete Appl. Math. 157, 2432\u20132438 (2009)","journal-title":"Discrete Appl. Math."},{"key":"1891_CR13","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.difgeo.2015.03.001","volume":"40","author":"YJ Lin","year":"2015","unstructured":"Lin, Y.J.: Connected sum construction of constant $$Q$$ Q -curvature maniolds in higher dimensions. Differ. Geom. Appl. 40, 290\u2013320 (2015)","journal-title":"Differ. Geom. Appl."},{"issue":"1\u20133","key":"1891_CR14","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0012-365X(00)00236-3","volume":"233","author":"M Loebl","year":"2001","unstructured":"Loebl, M., Matamala, M.: Some remarks on cycles in graphs and digraphs. Discret. Math. 233(1\u20133), 175\u2013182 (2001)","journal-title":"Discret. Math."},{"key":"1891_CR15","unstructured":"Mac Lane, S.: Categories for the Working Mathematician, 2nd edn., Graduate Texts in Mathematics (Book 5). Springer, New York (1998)"},{"key":"1891_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2372800","volume":"84","author":"J Milnor","year":"1962","unstructured":"Milnor, J.: A unique decomposition theorem for 3-manifolds. Am. J. Math. 84, 1\u20137 (1962)","journal-title":"Am. J. Math."},{"key":"1891_CR17","unstructured":"OEIS Foundation Inc.: The On-Line encyclopedia of integer sequences. http:\/\/oeis.org\/A085408 (2018)"},{"key":"1891_CR18","doi-asserted-by":"crossref","first-page":"231","DOI":"10.26493\/1855-3974.104.5b7","volume":"2","author":"P-J Ostermeier","year":"2009","unstructured":"Ostermeier, P.-J., Hellmuth, M., Klemm, K., Leydold, J., Stadler, P.F.: A note on quasi-robust cycle bases. Ars Math. Contemp. 2, 231\u2013240 (2009)","journal-title":"Ars Math. Contemp."},{"key":"1891_CR19","volume-title":"Algebraic Topology","author":"EH Spanier","year":"1966","unstructured":"Spanier, E.H.: Algebraic Topology. McGraw-Hill, New York (1966)"},{"key":"1891_CR20","unstructured":"Wall, C.T.C.: Classification problems in differential topology, V. Invent. Math. 1, 355\u2013374 (1966) [corrigendum, ibid 2, 306 (1966)]"},{"key":"1891_CR21","volume-title":"Graphs of Groups on Surfaces","author":"AT White","year":"2001","unstructured":"White, A.T.: Graphs of Groups on Surfaces. Elsevier, Amsterdam (2001)"},{"key":"1891_CR22","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. AMS 34, 339\u2013362 (1932)","journal-title":"Trans. AMS"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1891-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1891-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1891-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,14]],"date-time":"2019-10-14T00:45:18Z","timestamp":1571013918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1891-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,5]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1891"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1891-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2018,4,5]]},"assertion":[{"value":"4 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}