Add to ORKGIn this paper, we obtain a sufficient condition for the existence of parity factors in a regular graph in terms of edge-connectivity. Moreover, we also show that our condition is sharp
AbstractLet G be a connected graph with vertex set V and let d(ν) denote the degree of a vertex νϵV....
vertex set and the edge set of G, respectively. The number |V(G) | is called the order of G. If W £ ...
A graph G has a strong parity factor F if for every subset X ⊆ V (G) with |X| even, G contains a spa...
In this paper, we obtain a sufficient condition for the existence of parity factors in a regular gra...
In this paper, we obtain a sufficient condition for the existence of parity factors in a regular gra...
It is well known that if G=(V,E) is a connected multigraph and X subset of V is a subset of even ord...
AbstractWe present some conditions for the existence of a (g,f)-factor or a (g,f)-parity factor in a...
AbstractWe present sufficient conditions for a regular multipartite graph to have a regular factor a...
By Petersen’s Theorem, a bridgeless cubic graph has a 2-factor. Fleischner (<i>Discrete Math.</i>, 1...
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
AbstractA parity subgraph of a graph is a spanning subgraph such that the degrees of each vertex hav...
AbstractLet G be a k-regular, (k−1)-edge-connected graph with an even number of vertices, and let m ...
AbstractKaterinis and Tsikopoulos (Graphs. Combin. 12 (1996) 327) give sufficient conditions for a r...
AbstractGiven integers n, r and λ, we determine all values of k for which every simple r-regular gra...
AbstractLet G be a connected graph with vertex set V and let d(ν) denote the degree of a vertex νϵV....
vertex set and the edge set of G, respectively. The number |V(G) | is called the order of G. If W £ ...
A graph G has a strong parity factor F if for every subset X ⊆ V (G) with |X| even, G contains a spa...
In this paper, we obtain a sufficient condition for the existence of parity factors in a regular gra...
In this paper, we obtain a sufficient condition for the existence of parity factors in a regular gra...
It is well known that if G=(V,E) is a connected multigraph and X subset of V is a subset of even ord...
AbstractWe present some conditions for the existence of a (g,f)-factor or a (g,f)-parity factor in a...
AbstractWe present sufficient conditions for a regular multipartite graph to have a regular factor a...
By Petersen’s Theorem, a bridgeless cubic graph has a 2-factor. Fleischner (<i>Discrete Math.</i>, 1...
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
AbstractA parity subgraph of a graph is a spanning subgraph such that the degrees of each vertex hav...
AbstractLet G be a k-regular, (k−1)-edge-connected graph with an even number of vertices, and let m ...
AbstractKaterinis and Tsikopoulos (Graphs. Combin. 12 (1996) 327) give sufficient conditions for a r...
AbstractGiven integers n, r and λ, we determine all values of k for which every simple r-regular gra...
AbstractLet G be a connected graph with vertex set V and let d(ν) denote the degree of a vertex νϵV....
vertex set and the edge set of G, respectively. The number |V(G) | is called the order of G. If W £ ...
A graph G has a strong parity factor F if for every subset X ⊆ V (G) with |X| even, G contains a spa...