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

M. Abreu, M. Funk, D. Labbate +1

A graph $G$ admiting a $2$-factor is \textit{pseudo $2$-factor isomorphic} if the parity of the number of cycles in all its $2$-factors is the same. In [M. Abreu, A.A. Diwan, B. Ja…