{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:55:00Z","timestamp":1781463300044,"version":"3.54.1"},"reference-count":33,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004497","name":"KU Leuven Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004497","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100016973","name":"Francesco Severi National Institute of Higher Mathematics National Group of Algebra and Geometric Structures and their Applications","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100016973","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Research Foundation Flanders","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.05.022","type":"journal-article","created":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T11:16:28Z","timestamp":1779707788000},"page":"479-487","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The Gray graph is pseudo 2-factor isomorphic"],"prefix":"10.1016","volume":"391","author":[{"given":"Mari\u00e9n","family":"Abreu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8984-2463","authenticated-orcid":false,"given":"Jan","family":"Goedgebeur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jorik","family":"Jooken","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Federico","family":"Romaniello","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tibo","family":"Van den Eede","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.05.022_b1","doi-asserted-by":"crossref","unstructured":"M. Abreu, A.A. Diwan, B. Jackson, D. Labbate, J. Sheehan, Pseudo 2-factor isomorphic regular bipartite graphs, J. Comb. Theory, Ser. B 98 (2).","DOI":"10.1016\/j.jctb.2007.08.006"},{"key":"10.1016\/j.dam.2026.05.022_b2","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.dam.2022.12.016","article-title":"A construction for a counterexample to the pseudo 2-factor isomorphic graph conjecture","volume":"328","author":"Abreu","year":"2023","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.05.022_b3","doi-asserted-by":"crossref","DOI":"10.26493\/1855-3974.2672.73b","article-title":"Hamiltonian cycles and edge-colourings in a class of cubic graphs","volume":"23","author":"Abreu","year":"2023","journal-title":"Ars Math. Contemp."},{"key":"10.1016\/j.dam.2026.05.022_b4","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1016\/j.ejc.2013.09.008","article-title":"Odd 2-factored snarks","volume":"36","author":"Abreu","year":"2014","journal-title":"European J. Combin."},{"key":"10.1016\/j.dam.2026.05.022_b5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s10623-011-9522-0","article-title":"Irreducible pseudo 2-factor isomorphic cubic bipartite graphs","volume":"64","author":"Abreu","year":"2012","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/j.dam.2026.05.022_b6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.jctb.2004.05.002","article-title":"Regular bipartite graphs with all 2-factors isomorphic","volume":"92","author":"Aldred","year":"2004","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"4","key":"10.1016\/j.dam.2026.05.022_b7","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CMB-1968-063-0","article-title":"An edge but not vertex-transitive cubic graph","volume":"11","author":"Bouwer","year":"1968","journal-title":"Can. Math. Bull."},{"issue":"2","key":"10.1016\/j.dam.2026.05.022_b8","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/(SICI)1097-0118(199610)23:2<139::AID-JGT5>3.0.CO;2-U","article-title":"Fast generation of cubic graphs","volume":"23","author":"Brinkmann","year":"1996","journal-title":"J. Graph Theory"},{"issue":"335","key":"10.1016\/j.dam.2026.05.022_b9","doi-asserted-by":"crossref","first-page":"1483","DOI":"10.1090\/mcom\/3701","article-title":"The minimality of the Georges-Kelmans graph","volume":"91","author":"Brinkmann","year":"2022","journal-title":"Math. Comp."},{"key":"10.1016\/j.dam.2026.05.022_b10","doi-asserted-by":"crossref","unstructured":"R. \u010cada, S. Chiba, K. Ozeki, P Vr\u00e1na, K. Yoshimoto, A Relationship Between Thomassen\u2019s Conjecture and Bondy\u2019s Conjecture, SIAM J. Discrete Math. 29 (1).","DOI":"10.1137\/130937974"},{"issue":"3","key":"10.1016\/j.dam.2026.05.022_b11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10801-006-7397-3","article-title":"A census of semisymmetric cubic graphs on up to 768 vertices","volume":"23","author":"Conder","year":"2006","journal-title":"J. Algebraic Combin."},{"key":"10.1016\/j.dam.2026.05.022_b12","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1016\/j.jalgebra.2025.07.035","article-title":"Edge-transitive cubic graphs: analysis, cataloguing and enumeration","volume":"685","author":"Conder","year":"2026","journal-title":"J. Algebra"},{"key":"10.1016\/j.dam.2026.05.022_b13","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.dam.2022.10.013","article-title":"House of graphs 2.0: A database of interesting graphs and more","volume":"325","author":"Coolsaet","year":"2023","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.dam.2026.05.022_b14","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1016\/j.ejc.2010.12.003","article-title":"On the girth of voltage graph lifts","volume":"32","author":"Exoo","year":"2011","journal-title":"European J. Combin."},{"key":"10.1016\/j.dam.2026.05.022_b15","article-title":"On (k,g)-graphs without (g+1)-cycles","volume":"508","author":"Eze","year":"2026","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"10.1016\/j.dam.2026.05.022_b16","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0021-9800(67)80069-3","article-title":"Regular line-symmetric graphs","volume":"3","author":"Folkman","year":"1967","journal-title":"J. Comb. Theory"},{"issue":"1","key":"10.1016\/j.dam.2026.05.022_b17","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/S0095-8956(02)00031-X","article-title":"2-Factor hamiltonian graphs","volume":"87","author":"Funk","year":"2003","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2026.05.022_b18","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.dam.2015.04.021","article-title":"A counterexample to the pseudo 2-factor isomorphic graph conjecture","volume":"193","author":"Goedgebeur","year":"2015","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.05.022_b19","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2025.114442","article-title":"A note on the 2-factor hamiltonicity conjecture","volume":"348","author":"Gorsky","year":"2025","journal-title":"Discr. Math."},{"issue":"2","key":"10.1016\/j.dam.2026.05.022_b20","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/jgt.3190150204","article-title":"Updating the Hamiltonian problem - a survey","volume":"15","author":"Gould","year":"1991","journal-title":"J. Graph Theory"},{"issue":"1","key":"10.1016\/j.dam.2026.05.022_b21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00373-013-1377-x","article-title":"Recent advances on the Hamiltonian problem: survey III","volume":"30","author":"Gould","year":"2014","journal-title":"Graphs Combin."},{"key":"10.1016\/j.dam.2026.05.022_b22","series-title":"2-Factor parity checker [github repository]","author":"Jooken","year":"2025"},{"key":"10.1016\/j.dam.2026.05.022_b23","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/j.dam.2026.05.022_b24","doi-asserted-by":"crossref","unstructured":"R.M. Karp, M. Sipser, Maximum Matching in Sparse Random Graphs, in: 22nd Annual Symp. on Foundations of Computer Science, SFCS\u201981, 1981, pp. 364\u2013375.","DOI":"10.1109\/SFCS.1981.21"},{"key":"10.1016\/j.dam.2026.05.022_b25","series-title":"MatchMaker: A collection of algorithms for finding maximum transversals or maximum matchings in bipartite graphs. [computer software]","author":"Kaya","year":"2022"},{"issue":"1-3","key":"10.1016\/j.dam.2026.05.022_b26","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0012-365X(00)00327-7","article-title":"On 3-cut reductions of minimally 1-factorable cubic bigraphs","volume":"231","author":"Labbate","year":"2001","journal-title":"Discr. Math."},{"issue":"1-3","key":"10.1016\/j.dam.2026.05.022_b27","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0012-365X(01)00189-3","article-title":"Characterizing minimally 1-factorable r-regular bipartite graphs","volume":"248","author":"Labbate","year":"2002","journal-title":"Discr. Math."},{"key":"10.1016\/j.dam.2026.05.022_b28","first-page":"20","article-title":"A survey on 2-factors of regular graphs","volume":"105","author":"Labbate","year":"2025","journal-title":"Bull. Inst. Combin. Appl."},{"key":"10.1016\/j.dam.2026.05.022_b29","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.disc.2003.07.004","article-title":"An infinite family of cubic edge- but not vertex-transitive graphs","volume":"280","author":"Malni\u010d","year":"2002","journal-title":"Discr. Math."},{"key":"10.1016\/j.dam.2026.05.022_b30","first-page":"1","article-title":"The Gray graph revisited","volume":"35","author":"Maru\u0161i\u010d","year":"2000","journal-title":"J. Graph Theory"},{"issue":"2","key":"10.1016\/j.dam.2026.05.022_b31","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1002\/(SICI)1097-0118(199902)30:2<137::AID-JGT7>3.0.CO;2-G","article-title":"Fast generation of regular graphs and construction of cages","volume":"30","author":"Meringer","year":"1999","journal-title":"J. Graph Theory"},{"issue":"2","key":"10.1016\/j.dam.2026.05.022_b32","doi-asserted-by":"crossref","DOI":"10.37236\/10988","article-title":"Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs","volume":"30","author":"Romaniello","year":"2023","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.dam.2026.05.022_b33","unstructured":"E.W. Weisstein, Goedgebeur Graph, From MathWorld\u2013A Wolfram Resource https:\/\/mathworld.wolfram.com\/GoedgebeurGraph.html."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26003057?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26003057?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:07:20Z","timestamp":1781460440000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26003057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":33,"alternative-id":["S0166218X26003057"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.022","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The Gray graph is pseudo 2-factor isomorphic","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.022","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}