AbstractWe present some conditions for the existence of a (g,f)-factor or a (g,f)-parity factor in a graph G with the odd-cycle property that any two odd cycles of G either have a vertex in common or are joined by an edge
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper...
AbstractLetGbe a graph with vertex setVand letg, f:V→Z+. We say thatGhas all (g, f)-factors ifGhas a...
In this note we give a characterization of the complete bipartite graphs which have an even (odd) [a...
AbstractWe present some conditions for the existence of a (g,f)-factor or a (g,f)-parity factor in a...
In Section 1, we recall the historical sketch of matching and factor theory of graphs, and also intr...
It is well known that if G=(V,E) is a connected multigraph and X subset of V is a subset of even ord...
In this paper, we obtain a sufficient condition for the existence of parity factors in a regular gra...
AbstractWe simplify the criterion of Lovász for the existence of a (g, ƒ)-factor when g < ƒ, or when...
AbstractLet m ⩾ 3 be an odd integer. In this paper it is shown that if n ⩾ m is odd and m divides n,...
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
AbstractLet G be a k-regular, (k−1)-edge-connected graph with an even number of vertices, and let m ...
AbstractWe prove the following theorem: Let G be a graph with vertex-set V and ƒ, g be two integer-v...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
Let G be a graph and f: V (G) → {1, 3, 5,...}. Then a span-ning subgraph F of G is called a (1, f)-o...
In this note we give a characterization of the complete bipartite graphs which have an even (odd) [a...
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper...
AbstractLetGbe a graph with vertex setVand letg, f:V→Z+. We say thatGhas all (g, f)-factors ifGhas a...
In this note we give a characterization of the complete bipartite graphs which have an even (odd) [a...
AbstractWe present some conditions for the existence of a (g,f)-factor or a (g,f)-parity factor in a...
In Section 1, we recall the historical sketch of matching and factor theory of graphs, and also intr...
It is well known that if G=(V,E) is a connected multigraph and X subset of V is a subset of even ord...
In this paper, we obtain a sufficient condition for the existence of parity factors in a regular gra...
AbstractWe simplify the criterion of Lovász for the existence of a (g, ƒ)-factor when g < ƒ, or when...
AbstractLet m ⩾ 3 be an odd integer. In this paper it is shown that if n ⩾ m is odd and m divides n,...
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
AbstractLet G be a k-regular, (k−1)-edge-connected graph with an even number of vertices, and let m ...
AbstractWe prove the following theorem: Let G be a graph with vertex-set V and ƒ, g be two integer-v...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
Let G be a graph and f: V (G) → {1, 3, 5,...}. Then a span-ning subgraph F of G is called a (1, f)-o...
In this note we give a characterization of the complete bipartite graphs which have an even (odd) [a...
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper...
AbstractLetGbe a graph with vertex setVand letg, f:V→Z+. We say thatGhas all (g, f)-factors ifGhas a...
In this note we give a characterization of the complete bipartite graphs which have an even (odd) [a...
DOI
Add to ORKG