A construction for a counterexample to the pseudo 2-factor isomorphic graph conjecture

DOI10.1016/j.dam.2022.12.016OpenAlexW4313420483WikidataQ123133589 ScholiaQ123133589MaRDI QIDQ2685701

Domenico Labbate, Federico Romaniello, Marién Abreu, Martin Funk

Publication date: 22 February 2023

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

Full work available at URL: https://arxiv.org/abs/2207.10961

zbMATH Keywords

bipartiteautomorphismsconfigurations2-factorcubic

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Irreducible pseudo 2-factor isomorphic cubic bipartite graphs
• The Magma algebra system. I: The user language
• 2-factor Hamiltonian graphs.
• On minimally one-factorable \(r\)-regular bipartite graphs
• Characterizing minimally 1-factorable \(r\)-regular bipartite graphs
• Counting symmetric configurations \(v_3\)
• A counterexample to the pseudo 2-factor isomorphic graph conjecture
• Pseudo 2-factor isomorphic regular bipartite graphs
• The Groups of Order Sixteen Made Easy
• Self-dual configurations and regular graphs

This page was built for publication: A construction for a counterexample to the pseudo 2-factor isomorphic graph conjecture