The Gray graph is pseudo 2-factor isomorphic

DOI10.1016/J.DAM.2026.05.022MaRDI QIDQ7289260zbMATH OpenFDO

Authors M. Abreu, Jan Goedgebeur, Jorik Jooken, Federico Romaniello, Tibo Van den Eede

Publication date 2 July 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2026.05.022

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• 2-factor Hamiltonian graphs.
• A census of semisymmetric cubic graphs on up to 768 vertices
• A construction for a counterexample to the pseudo 2-factor isomorphic graph conjecture
• A counterexample to the pseudo 2-factor isomorphic graph conjecture
• A note on the 2-factor Hamiltonicity conjecture
• A relationship between Thomassen's conjecture and Bondy's conjecture
• A survey on 2-factors of regular graphs
• An Edge but not Vertex Transitive Cubic Graph^*
• An infinite family of cubic edge- but not vertex-transitive graphs
• Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs
• Characterizing minimally 1-factorable r-regular bipartite graphs
• Edge-transitive cubic graphs: analysis, cataloguing and enumeration
• Fast generation of cubic graphs
• Fast generation of regular graphs and construction of cages
• House of graphs 2.0: a database of interesting graphs and more
• Irreducible pseudo 2-factor isomorphic cubic bipartite graphs
• Odd 2-factored snarks
• On 3-cut reductions of minimally 1-factorable cubic bigraphs
• On (k,g)-graphs without (g + 1)-cycles
• On the girth of voltage graph lifts
• Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs
• Pseudo 2-factor isomorphic regular bipartite graphs
• Recent advances on the Hamiltonian problem: survey III
• Reducibility among combinatorial problems
• Regular bipartite graphs with all 2-factors isomorphic
• Regular line-symmetric graphs
• The Gray graph revisited
• The minimality of the Georges-Kelmans graph
• Updating the hamiltonian problem—A survey

Cited in

(1)

• New small regular graphs of given girth: the cage problem and beyond

This page was built for publication: The Gray graph is pseudo 2-factor isomorphic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289260)