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
AbstractLet f(k) be the largest number such that each k-regular bipartite graph with 2n vertices has...
AbstractLet G be a k-regular graph of order 2n such that k≥n. Hilton (J. Graph Theory, 9 (1985), 193...
It is shown that if K is any regular complete multipartite graph of even degree, and F is any bipart...
AbstractThe set of two-factors of a bipartite k-regular graph, k>2, spans the cycle space of the gra...
AbstractWe prove that if G is a k-regular bipartite graph and all 2-factors of G are isomorphic then...
AbstractLet k≥1 be an integer and G=(V1,V2;E) a bipartite graph with |V1|=|V2|=n such that n≥2k+2. I...
AbstractWe present sufficient conditions for a regular multipartite graph to have a regular factor a...
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...
AbstractLet F be a 2-regular graph. We prove that the complete bipartite graph Kn,n can be decompose...
AbstractLet G be a k-regular graph of order 2n such that k≥n. Hilton (J. Graph Theory, 9 (1985), 193...
AbstractA graph G is pseudo 2-factor isomorphic if the parity of the number of circuits in a 2-facto...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
The k-restricted 2-factor problem is that of finding a spanning subgraph consisting of disjoint cycl...
AbstractLet f(k) be the largest number such that each k-regular bipartite graph with 2n vertices has...
AbstractLet G be a k-regular graph of order 2n such that k≥n. Hilton (J. Graph Theory, 9 (1985), 193...
It is shown that if K is any regular complete multipartite graph of even degree, and F is any bipart...
AbstractThe set of two-factors of a bipartite k-regular graph, k>2, spans the cycle space of the gra...
AbstractWe prove that if G is a k-regular bipartite graph and all 2-factors of G are isomorphic then...
AbstractLet k≥1 be an integer and G=(V1,V2;E) a bipartite graph with |V1|=|V2|=n such that n≥2k+2. I...
AbstractWe present sufficient conditions for a regular multipartite graph to have a regular factor a...
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...
AbstractLet F be a 2-regular graph. We prove that the complete bipartite graph Kn,n can be decompose...
AbstractLet G be a k-regular graph of order 2n such that k≥n. Hilton (J. Graph Theory, 9 (1985), 193...
AbstractA graph G is pseudo 2-factor isomorphic if the parity of the number of circuits in a 2-facto...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
The k-restricted 2-factor problem is that of finding a spanning subgraph consisting of disjoint cycl...
AbstractLet f(k) be the largest number such that each k-regular bipartite graph with 2n vertices has...
AbstractLet G be a k-regular graph of order 2n such that k≥n. Hilton (J. Graph Theory, 9 (1985), 193...
It is shown that if K is any regular complete multipartite graph of even degree, and F is any bipart...
DOI
Add to ORKG