Add to ORKGThe Heawood graph and the complete bipartite graph $K_{3,3}$ 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 $k \le 3$
We show that a digraph which contains a directed 2-factor and has minimum in-degree and outdegree at...
We show that a digraph which contains a directed 2-factor and has minimum in-degree and outdegree at...
AbstractThe set of two-factors of a bipartite k-regular graph, k>2, spans the cycle space of the gra...
The Heawood graph and the complete bipartite graph $K_{3,3}$ have the property that all of their 2-f...
The Heawood graph and the complete bipartite graph $K_{3,3}$ have the property that all of their 2-f...
AbstractWe prove that if G is a k-regular bipartite graph and all 2-factors of G are isomorphic then...
A graph G is pseudo 2-factor isomorphic if the parity of the number of circuits in a 2-factor is the...
A graph G is pseudo 2-factor isomorphic if the parity of the number of circuits in a 2-factor is the...
A graph G is pseudo 2-factor isomorphic if the parity of the number of circuits in a 2-factor is the...
The Heawood graph and $K_{3,3}$ have the property that all of their 2-factors are Hamilton circuits....
The Heawood graph and $K_{3,3}$ have the property that all of their 2-factors are Hamilton circuits....
The Heawood graph and $K_{3,3}$ have the property that all of their 2-factors are Hamilton circuits....
A graph G is pseudo 2-factor isomorphic if the parity of the number of circuits in a 2-factor is the...
AbstractA graph G is pseudo 2-factor isomorphic if the parity of the number of circuits in a 2-facto...
We show that a digraph which contains a directed 2-factor and has minimum in-degree and outdegree at...
We show that a digraph which contains a directed 2-factor and has minimum in-degree and outdegree at...
We show that a digraph which contains a directed 2-factor and has minimum in-degree and outdegree at...
AbstractThe set of two-factors of a bipartite k-regular graph, k>2, spans the cycle space of the gra...
The Heawood graph and the complete bipartite graph $K_{3,3}$ have the property that all of their 2-f...
The Heawood graph and the complete bipartite graph $K_{3,3}$ have the property that all of their 2-f...
AbstractWe prove that if G is a k-regular bipartite graph and all 2-factors of G are isomorphic then...
A graph G is pseudo 2-factor isomorphic if the parity of the number of circuits in a 2-factor is the...
A graph G is pseudo 2-factor isomorphic if the parity of the number of circuits in a 2-factor is the...
A graph G is pseudo 2-factor isomorphic if the parity of the number of circuits in a 2-factor is the...
The Heawood graph and $K_{3,3}$ have the property that all of their 2-factors are Hamilton circuits....
The Heawood graph and $K_{3,3}$ have the property that all of their 2-factors are Hamilton circuits....
The Heawood graph and $K_{3,3}$ have the property that all of their 2-factors are Hamilton circuits....
A graph G is pseudo 2-factor isomorphic if the parity of the number of circuits in a 2-factor is the...
AbstractA graph G is pseudo 2-factor isomorphic if the parity of the number of circuits in a 2-facto...
We show that a digraph which contains a directed 2-factor and has minimum in-degree and outdegree at...
We show that a digraph which contains a directed 2-factor and has minimum in-degree and outdegree at...
We show that a digraph which contains a directed 2-factor and has minimum in-degree and outdegree at...
AbstractThe set of two-factors of a bipartite k-regular graph, k>2, spans the cycle space of the gra...