A counterexample to the pseudo 2-factor isomorphic graph conjecture

DOI10.1016/j.dam.2015.04.021zbMath1317.05124arXiv1412.3350OpenAlexW1560173187WikidataQ122962562 ScholiaQ122962562MaRDI QIDQ2354717

Jan Goedgebeur

Publication date: 24 July 2015

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

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

zbMATH Keywords

bipartite graphcounterexample2-factorcubic graphcomputation

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

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

Uses Software

• House of Graphs
• GENREG
• snarkhunter

Cites Work

• Irreducible pseudo 2-factor isomorphic cubic bipartite graphs
• Generation and properties of snarks
• 2-factor Hamiltonian graphs.
• Characterizing minimally 1-factorable \(r\)-regular bipartite graphs
• House of Graphs: a database of interesting graphs
• A counterexample to the pseudo 2-factor isomorphic graph conjecture
• Pseudo 2-factor isomorphic regular bipartite graphs
• Fast generation of regular graphs and construction of cages
• Fast generation of cubic graphs
• The Generation of Fullerenes
• On 3-cut reductions of minimally 1-factorable cubic bigraphs

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