3 research outputs found
Irreducible pseudo 2-factor isomorphic cubic bipartite graphs
A bipartite graph is {\em pseudo 2--factor isomorphic} if all its 2--factors
have the same parity of number of circuits. In \cite{ADJLS} we proved that the
only essentially 4--edge-connected pseudo 2--factor isomorphic cubic bipartite
graph of girth 4 is , and conjectured \cite[Conjecture 3.6]{ADJLS}
that the only essentially 4--edge-connected cubic bipartite graphs are
, the Heawood graph and the Pappus graph.
There exists a characterization of symmetric configurations %{\bf
decide notation and how to use it in the rest of the paper} due to Martinetti
(1886) in which all symmetric configurations can be obtained from an
infinite set of so called {\em irreducible} configurations \cite{VM}. The list
of irreducible configurations has been completed by Boben \cite{B} in terms of
their {\em irreducible Levi graphs}.
In this paper we characterize irreducible pseudo 2--factor isomorphic cubic
bipartite graphs proving that the only pseudo 2--factor isomorphic irreducible
Levi graphs are the Heawood and Pappus graphs. Moreover, the obtained
characterization allows us to partially prove the above Conjecture
Regular bipartite graphs with all 2-factors isomorphic
The Heawood graph and the complete bipartite graph have the property that all of their 2-factors are
hamiltonian cycles. We call such graphs 2-factor hamiltonian. In this paper, we study k-regular bipartite graphs with the apparently more
general property that all their 2-factors are isomorphic.
We prove that if G is a k-regular bipartite graph and all 2-factors of G are isomorphic then