DOIAbstract
AbstractThe set of two-factors of a bipartite k-regular graph, k>2, spans the cycle space of the graph. In addition, a new non-hamiltonian 3-connected bicubic graph on 92 vertices is constructed
AbstractThe set of two-factors of a bipartite k-regular graph, k>2, spans the cycle space of the graph. In addition, a new non-hamiltonian 3-connected bicubic graph on 92 vertices is constructed
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...
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...
The Heawood graph and the complete bipartite graph $K_{3,3}$ have the property that all of their 2-f...
The k-restricted 2-factor problem is that of finding a spanning subgraph consisting of disjoint cycl...
A necessary and sufficient condition is obtained for a bipartite graph to have an f-factor which inc...
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....
For all integers n greater than or equal to 5, it is shown that the graph obtained from the n-cycle ...
The Heawood graph and $K_{3,3}$ have the property that all of their 2-factors are Hamilton circuits....
AbstractLet k≥1 be an integer and G=(V1,V2;E) a bipartite graph with |V1|=|V2|=n such that n≥2k+2. I...
AbstractLet G be a k-regular graph of order 2n such that k≥n. Hilton (J. Graph Theory, 9 (1985), 193...
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...
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...
The Heawood graph and the complete bipartite graph $K_{3,3}$ have the property that all of their 2-f...
The k-restricted 2-factor problem is that of finding a spanning subgraph consisting of disjoint cycl...
A necessary and sufficient condition is obtained for a bipartite graph to have an f-factor which inc...
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....
For all integers n greater than or equal to 5, it is shown that the graph obtained from the n-cycle ...
The Heawood graph and $K_{3,3}$ have the property that all of their 2-factors are Hamilton circuits....
AbstractLet k≥1 be an integer and G=(V1,V2;E) a bipartite graph with |V1|=|V2|=n such that n≥2k+2. I...
AbstractLet G be a k-regular graph of order 2n such that k≥n. Hilton (J. Graph Theory, 9 (1985), 193...
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...
Add to ORKG