{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:24:46Z","timestamp":1755217486209,"version":"3.43.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031826696"},{"type":"electronic","value":"9783031826702"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-82670-2_24","type":"book-chapter","created":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T04:40:03Z","timestamp":1738816803000},"page":"333-346","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generation of\u00a0Cycle Permutation Graphs and\u00a0Permutation Snarks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8984-2463","authenticated-orcid":false,"given":"Jan","family":"Goedgebeur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1147-1460","authenticated-orcid":false,"given":"Jarne","family":"Renders","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,7]]},"reference":[{"issue":"4","key":"24_CR1","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1016\/j.jctb.2013.05.001","volume":"103","author":"G Brinkmann","year":"2013","unstructured":"Brinkmann, G., Goedgebeur, J., H\u00e4gglund, J., Markstr\u00f6m, K.: Generation and properties of snarks. J. Comb. Theory Ser. B 103(4), 468\u2013488 (2013). https:\/\/doi.org\/10.1016\/j.jctb.2013.05.001","journal-title":"J. Comb. Theory Ser. B"},{"issue":"335","key":"24_CR2","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.1090\/mcom\/3701","volume":"91","author":"G Brinkmann","year":"2022","unstructured":"Brinkmann, G., Goedgebeur, J., Mckay, B.D.: The minimality of the Georges-Kelmans graph. Math. Comput. 91(335), 1483\u20131500 (2022). https:\/\/doi.org\/10.1090\/mcom\/3701","journal-title":"Math. Comput."},{"issue":"4","key":"24_CR3","first-page":"433","volume":"3","author":"G Chartrand","year":"1967","unstructured":"Chartrand, G., Harary, F.: Planar permutation graphs. Ann. Inst. H. Poincare 3(4), 433\u2013438 (1967)","journal-title":"Ann. Inst. H. Poincare"},{"key":"24_CR4","doi-asserted-by":"publisher","unstructured":"Coolsaet, K., D\u2019hondt, S., Goedgebeur, J.: House of graphs 2.0: a database of interesting graphs and more. Discret. Appl. Math. 325, 97\u2013107 (2023). https:\/\/doi.org\/10.1016\/j.dam.2022.10.013","DOI":"10.1016\/j.dam.2022.10.013"},{"key":"24_CR5","unstructured":"Faradzev, I.A.: Algorithmic Studies in Combinatorics, chap. Generation of nonisomorphic graphs with a given degree sequence, pp. 11\u201319. Nauka (1978). (Russian)"},{"key":"24_CR6","unstructured":"Goedgebeur, J., Renders, J.: Cycle Permutation Graphs, (Version 1) [Computer software] (2024). https:\/\/github.com\/JarneRenders\/Cycle-Permutation-Graphs"},{"key":"24_CR7","unstructured":"Goedgebeur, J., Renders, J.: Generation of cycle permutation graphs and permutation snarks (2024). https:\/\/arxiv.org\/abs\/2411.12606"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BFb0067368","volume-title":"Graph Theory and Applications","author":"V Klee","year":"1972","unstructured":"Klee, V.: Which generalized prisms admit H-circuits? In: Alavi, Y., Lick, D.R., White, A.T. (eds.) Graph Theory and Applications, pp. 173\u2013178. Springer, Heidelberg (1972). https:\/\/doi.org\/10.1007\/BFb0067368"},{"issue":"2","key":"24_CR9","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1006\/jagm.1997.0898","volume":"26","author":"BD McKay","year":"1998","unstructured":"McKay, B.D.: Isomorph-free exhaustive generation. J. Algorithms 26(2), 306\u2013324 (1998). https:\/\/doi.org\/10.1006\/jagm.1997.0898","journal-title":"J. Algorithms"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism. II. J. Symb. Comput. 60, 94\u2013112 (2014). https:\/\/doi.org\/10.1016\/j.jsc.2013.09.003","journal-title":"II. J. Symb. Comput."},{"key":"24_CR11","unstructured":"M\u00e1ajov\u00e1, E., S\u030ckoviera, M.: Permutation snarks of order 2 (mod 8). Acta Math. Univ. Comen. 88(3), 929\u2013934 (2019)"},{"key":"24_CR12","first-page":"233","volume":"17","author":"T Pisanski","year":"1982","unstructured":"Pisanski, T., Shawe-Taylor, J.: Cycle permutation graphs with large girth. Glas. Mat. 17, 233\u2013236 (1982)","journal-title":"Glas. Mat."},{"issue":"1","key":"24_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0012-365X(81)90179-5","volume":"36","author":"T Pisanski","year":"1981","unstructured":"Pisanski, T., Shawe-Taylor, J.: Search for minimal trivalent cycle permutation graphs with girth nine. Disc. Math. 36(1), 113\u2013115 (1981). https:\/\/doi.org\/10.1016\/0012-365X(81)90179-5","journal-title":"Disc. Math."},{"key":"24_CR14","doi-asserted-by":"publisher","unstructured":"Read, R.C.: Every one a winner or how to avoid isomorphism search when cataloguing combinatorial configurations*. In: Alspach, B., Hell, P., Miller, D.J. (eds.) Annals of Discrete Mathematics, Algorithmic Aspects of Combinatorics, vol.\u00a02, pp. 107\u2013120. Elsevier, Amsterdam (1978). https:\/\/doi.org\/10.1016\/S0167-5060(08)70325-X","DOI":"10.1016\/S0167-5060(08)70325-X"},{"issue":"3","key":"24_CR15","first-page":"197","volume":"28","author":"MZ Rozenfel\u2019d","year":"1973","unstructured":"Rozenfel\u2019d, M.Z.: The construction and properties of certain classes of strongly regular graphs (Russian). Uspehi Mat. Nauk 28(3), 197\u2013198 (1973)","journal-title":"Uspehi Mat. Nauk"},{"key":"24_CR16","first-page":"341","volume-title":"Graph Theory and Related Topics","author":"PD Seymour","year":"1979","unstructured":"Seymour, P.D.: Sums of circuits. In: Bondy, J.A., Murty, U.R.S. (eds.) Graph Theory and Related Topics, pp. 341\u2013355. Academic Press, New York (1979)"},{"issue":"3","key":"24_CR17","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1017\/S0004972700042660","volume":"8","author":"G Szekeres","year":"1973","unstructured":"Szekeres, G.: Polyhedral decompositions of cubic graphs. B. Aust. Math. Soc. 8(3), 367\u2013387 (1973). https:\/\/doi.org\/10.1017\/S0004972700042660","journal-title":"B. Aust. Math. Soc."},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"80","DOI":"10.4153\/CJM-1954-010-9","volume":"6","author":"WT Tutte","year":"1954","unstructured":"Tutte, W.T.: A contribution to the theory of chromatic polynomials. Can. J. Math. 6, 80\u201391 (1954). https:\/\/doi.org\/10.4153\/CJM-1954-010-9","journal-title":"Can. J. Math."},{"key":"24_CR19","unstructured":"Zhang, C.Q.: Integer Flows and Cycle Covers of Graphs. No.\u00a0205 in Monographs and Textbooks in Pure and Applied Mathematics. Marcel Dekker, New York (1997)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2025: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82670-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T15:27:07Z","timestamp":1754407627000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82670-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031826696","9783031826702"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82670-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"7 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sofsem.sk","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}