{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T16:50:55Z","timestamp":1775753455865,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T00:00:00Z","timestamp":1771804800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T00:00:00Z","timestamp":1771804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["P1-0294"],"award-info":[{"award-number":["P1-0294"]}],"id":[{"id":"10.13039\/501100004329","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,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    A\n                    <jats:italic>bicirculant<\/jats:italic>\n                    is a regular,\n                    <jats:italic>d<\/jats:italic>\n                    -valent graph that admits a semiregular automorphism of order\n                    <jats:italic>m<\/jats:italic>\n                    having two vertex-orbits of size\n                    <jats:italic>m<\/jats:italic>\n                    . The vertices of each orbit induce a circulant graph of order\n                    <jats:italic>m<\/jats:italic>\n                    and the remaining edges span a regular bipartite graph of valence, say\n                    <jats:italic>s<\/jats:italic>\n                    ,\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$1 \\le s \\le d$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mn>1<\/mml:mn>\n                            <mml:mo>\u2264<\/mml:mo>\n                            <mml:mi>s<\/mml:mi>\n                            <mml:mo>\u2264<\/mml:mo>\n                            <mml:mi>d<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , connecting the two vertex-orbits. Generalized Petersen graphs constitute a prominent family of bicirculants, with\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$d = 3$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>d<\/mml:mi>\n                            <mml:mo>=<\/mml:mo>\n                            <mml:mn>3<\/mml:mn>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    and\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$s = 1$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>s<\/mml:mi>\n                            <mml:mo>=<\/mml:mo>\n                            <mml:mn>1<\/mml:mn>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . In 1983, Brian Alspach proved that all generalized Petersen graphs are hamiltonian, except for the family\n                    <jats:italic>G<\/jats:italic>\n                    (\n                    <jats:italic>m<\/jats:italic>\n                    ,\u00a02) with\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$m\\equiv 5\\pmod 6$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>m<\/mml:mi>\n                            <mml:mo>\u2261<\/mml:mo>\n                            <mml:mn>5<\/mml:mn>\n                            <mml:mspace\/>\n                            <mml:mo>(<\/mml:mo>\n                            <mml:mo>mod<\/mml:mo>\n                            <mml:mspace\/>\n                            <mml:mn>6<\/mml:mn>\n                            <mml:mo>)<\/mml:mo>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . In this paper we conjecture that among all connected bicirculants of valence at least 2, there are no other exceptions. It follows from various sources that the conjecture is true for all cubic bicirculants. In this paper we prove the conjecture for quartic bicirulants with\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$s = 2$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>s<\/mml:mi>\n                            <mml:mo>=<\/mml:mo>\n                            <mml:mn>2<\/mml:mn>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , also known as the generalized rose window graphs.\n                  <\/jats:p>","DOI":"10.1007\/s00373-026-03016-w","type":"journal-article","created":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T07:35:07Z","timestamp":1771832107000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["All generalized rose window graphs are hamiltonian"],"prefix":"10.1007","volume":"42","author":[{"given":"Simona","family":"Bonvicini","sequence":"first","affiliation":[]},{"given":"Toma\u017e","family":"Pisanski","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7737-1836","authenticated-orcid":false,"given":"Arjana","family":"\u017ditnik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,23]]},"reference":[{"key":"3016_CR1","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0095-8956(83)90042-4","volume":"34","author":"B Alspach","year":"1983","unstructured":"Alspach, B.: The classification of Hamiltonian generalized Petersen graphs. J. Combin. Theory Ser. B 34, 293\u2013312 (1983)","journal-title":"J. Combin. Theory Ser. B"},{"key":"3016_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.26493\/1855-3974.101.a37","volume":"3","author":"B Alspach","year":"2010","unstructured":"Alspach, B., Chen, C.C., Dean, M.: Hamilton paths in Cayley graphs on generalized dihedral groups. Ars Math. Contemp. 3, 29\u201347 (2010)","journal-title":"Ars Math. Contemp."},{"key":"3016_CR3","doi-asserted-by":"publisher","first-page":"5461","DOI":"10.1016\/j.disc.2008.12.016","volume":"309","author":"B Alspach","year":"2009","unstructured":"Alspach, B., Liu, J.: On the Hamilton connectivity of generalized Petersen graphs. Discrete Math. 309, 5461\u20135473 (2009)","journal-title":"Discrete Math."},{"key":"3016_CR4","first-page":"101","volume":"28","author":"B Alspach","year":"1989","unstructured":"Alspach, B., Zhang, C.Q.: Hamilton cycles in cubic Cayley graphs on dihedral groups. Ars Combin. 28, 101\u2013108 (1989)","journal-title":"Ars Combin."},{"key":"3016_CR5","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1007\/s00373-014-1447-8","volume":"31","author":"A Arroyo","year":"2015","unstructured":"Arroyo, A., Hubard, I., Kutnar, K., O\u2019Reilly, E., \u0160parl, P.: Classification of symmetric Taba\u010djn graphs. Graphs Combin. 31, 1137\u20131153 (2015)","journal-title":"Graphs Combin."},{"key":"3016_CR6","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/S0195-6698(03)00031-3","volume":"24","author":"M Boben","year":"2003","unstructured":"Boben, M., Pisanski, T.: Polycyclic configurations. Eur. J. Comb. 24, 431\u2013457 (2003)","journal-title":"Eur. J. Comb."},{"key":"3016_CR7","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1002\/jcd.20054","volume":"13","author":"M Boben","year":"2005","unstructured":"Boben, M., Pisanski, T., \u017ditnik, A.: $$I$$-graphs and the corresponding configurations. J. Combin. Des. 13, 406\u2013424 (2005)","journal-title":"J. Combin. Des."},{"key":"3016_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.26493\/1855-3974.921.b14","volume":"12","author":"S Bonvicini","year":"2017","unstructured":"Bonvicini, S., Pisanski, T.: A novel characterization of cubic Hamiltonian graphs via the associated quartic graphs. Ars Math. Contemp. 12, 1\u201324 (2017)","journal-title":"Ars Math. Contemp."},{"key":"3016_CR9","doi-asserted-by":"crossref","unstructured":"Bonvicini, S., Pisanski, T., \u017ditnik, A.: All generalized rose window graphs are hamiltonian, arXiv:2504.16205, (2025)","DOI":"10.1007\/s00373-026-03016-w"},{"key":"3016_CR10","unstructured":"Bouwer, I. Z., Chernoff, W. W., Monson, B., Star, Z.: The Foster Census, Charles Babbage Research Centre, (1988)"},{"key":"3016_CR11","doi-asserted-by":"crossref","unstructured":"Damnjanovi\u0107, I., Ba\u0161i\u0107, N., Pisanski, T., \u017ditnik, A.: Classification of quartic bicirculant nut graphs, arXiv:2502.06353, (2025)","DOI":"10.37236\/12668"},{"key":"3016_CR12","doi-asserted-by":"crossref","unstructured":"Das, A.: A. Mandal, Classification of Cayley rose window graphs, Theory Appl. Graphs8, no.1, Art. 7, 20 pp (2021)","DOI":"10.20429\/tag.2021.080107"},{"key":"3016_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.26493\/1855-3974.362.504","volume":"9","author":"E Dobson","year":"2015","unstructured":"Dobson, E., Kov\u00e1cs, I., Miklavi\u010d, \u0160: The automorphism groups of non-edge-transitive rose window graphs. Ars Math. Contemp. 9, 63\u201375 (2015)","journal-title":"Ars Math. Contemp."},{"key":"3016_CR14","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.disc.2014.01.001","volume":"323","author":"E Dobson","year":"2014","unstructured":"Dobson, E., Kov\u00e1cs, I., Miklavi\u010d, \u0160: The isomorphism problem for rose window graphs. Discrete Math. 323, 7\u201313 (2014)","journal-title":"Discrete Math."},{"key":"3016_CR15","unstructured":"Gross, J.L., Tucker, T.W.: Topological Graph Theory. Dover books on mathematics, Dover Publications (2001)"},{"key":"3016_CR16","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.jctb.2017.03.001","volume":"125","author":"M Giudici","year":"2017","unstructured":"Giudici, M., Kov\u00e1cs, I., Li, C.H., Verret, G.: Cubic arc-transitive $$k$$-multicirculants. J. Combin. Theory Ser. B 125, 80\u201394 (2017)","journal-title":"J. Combin. Theory Ser. B"},{"key":"3016_CR17","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0012-365X(01)00064-4","volume":"244","author":"M Hladnik","year":"2002","unstructured":"Hladnik, M., Maru\u0161i\u010d, D., Pisanski, T.: Cyclic Haar graphs. Discrete Math. 244, 137\u2013152 (2002)","journal-title":"Discrete Math."},{"key":"3016_CR18","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/jgt.22608","volume":"96","author":"I Hubard","year":"2021","unstructured":"Hubard, I., Ramos-Rivera, A., \u0160parl, P.: Arc-transitive maps with underlying rose window graphs. J. Graph Theory 96, 203\u2013230 (2021)","journal-title":"J. Graph Theory"},{"key":"3016_CR19","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s40840-020-00960-5","volume":"44","author":"D Jokanovi\u0107","year":"2021","unstructured":"Jokanovi\u0107, D., Miklavi\u010d, \u0160, Mili\u0107evi\u0107, M., \u0160parl, P.: Domination in rose window graphs. Bull. Malays. Math. Sci. Soc. 44, 509\u2013526 (2021)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"3016_CR20","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/jgt.20475","volume":"65","author":"I Kov\u00e1cs","year":"2010","unstructured":"Kov\u00e1cs, I., Kutnar, K., Maru\u0161i\u010d, D.: Classification of edge-transitive rose window graphs. J. Graph Theory 65, 216\u2013231 (2010)","journal-title":"J. Graph Theory"},{"key":"3016_CR21","doi-asserted-by":"publisher","first-page":"1802","DOI":"10.1016\/j.disc.2009.12.010","volume":"310","author":"I Kov\u00e1cs","year":"2010","unstructured":"Kov\u00e1cs, I., Kutnar, K., Ruff, J.: Rose window graphs underlying rotary maps. Discrete Math. 310, 1802\u20131811 (2010)","journal-title":"Discrete Math."},{"key":"3016_CR22","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1002\/jgt.20594","volume":"69","author":"I Kov\u00e1cs","year":"2012","unstructured":"Kov\u00e1cs, I., Kuzman, B., Malni\u010d, A., Wilson, S.: Characterization of edge-transitive 4-valent bicirculants. J. Graph Theory 69, 441\u2013463 (2012)","journal-title":"J. Graph Theory"},{"key":"3016_CR23","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.2298\/FIL1307157K","volume":"27","author":"K Kutnar","year":"2013","unstructured":"Kutnar, K., Maru\u0161i\u010d, D., Miklavi\u010d, \u0160, Stra\u0161ek, R.: Automorphisms of Taba\u010djn graphs. Filomat 27, 1157\u20131164 (2013)","journal-title":"Filomat"},{"key":"3016_CR24","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0012-365X(83)90269-8","volume":"46","author":"D Maru\u0161i\u010d","year":"1983","unstructured":"Maru\u0161i\u010d, D.: Hamiltonian circuits in Cayley graphs. Discrete Math. 46, 49\u201354 (1983)","journal-title":"Discrete Math."},{"key":"3016_CR25","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/j.disc.2005.09.053","volume":"307","author":"T Pisanski","year":"2007","unstructured":"Pisanski, T.: A classification of cubic bicirculants. Discrete Math. 307, 567\u2013578 (2007)","journal-title":"Discrete Math."},{"key":"3016_CR26","doi-asserted-by":"publisher","first-page":"7","DOI":"10.26493\/1855-3974.13.5bb","volume":"1","author":"S Wilson","year":"2008","unstructured":"Wilson, S.: Rose window graphs. Ars. Math. Contemp. 1, 7\u201319 (2008)","journal-title":"Ars. Math. Contemp."},{"key":"3016_CR27","doi-asserted-by":"publisher","first-page":"475","DOI":"10.4134\/JKMS.2012.49.3.475","volume":"49","author":"A \u017ditnik","year":"2012","unstructured":"\u017ditnik, A., Horvat, B., Pisanski, T.: All generalized Petersen graphs are unit-distance graphs. J. Korean Math. Soc. 49, 475\u2013491 (2012)","journal-title":"J. Korean Math. Soc."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03016-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-026-03016-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03016-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:14:28Z","timestamp":1775715268000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-026-03016-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,23]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["3016"],"URL":"https:\/\/doi.org\/10.1007\/s00373-026-03016-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,23]]},"assertion":[{"value":"30 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"27"}}