AbstractLetGbe a graph with vertex setVand letg, f:V→Z+. We say thatGhas all (g, f)-factors ifGhas anh-factor for everyh:V→Z+such thatg(v)⩽h(v)⩽f(v) for everyv∈Vand at least one suchhexists. In this note, we derive from Tutte'sf-factor theorem a similar characterization for the property of having all (g, f)-factors. An analogous result for parity-factors is presented also
AbstractWe present some conditions for the existence of a (g,f)-factor or a (g,f)-parity factor in a...
AbstractLet G be a connected graph of order n, a and b be integers such that 1 ≤ a ≤ b and 2 ≤ b, an...
Abstract: A (g, f)-factor of a graph is a subset F of E such that for all v ∈ V, g(v) ≤ degF(v) ≤ ...
AbstractLetGbe a graph with vertex setVand letg, f:V→Z+. We say thatGhas all (g, f)-factors ifGhas a...
AbstractWe prove the following theorem: Let G be a graph with vertex-set V and ƒ, g be two integer-v...
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
AbstractWe simplify the criterion of Lovász for the existence of a (g, ƒ)-factor when g < ƒ, or when...
AbstractWe give sufficient conditions for a graph to have a (g, f)-factor. For example, we prove tha...
AbstractA relationship is considered between an f-factor of a graph and that of its vertex-deleted s...
In this thesis, we deal with a problem of factors in graphs.First, we consider a relationship betwee...
AbstractFor a set {A, B, C, …} of graphs, an {A, B, C, …}-factor of a graph G is defined to be a spa...
AbstractLet 1≤a<b be integers and G a graph of order n sufficiently large for a and b. Then G has an...
AbstractTwo criteria for a tree to have an f-factor and (g,f)-factors are presented, respectively. T...
AbstractLet G be a graph with vertex set V(G). A spanning subgraph F of G is called a [k,k+1]-factor...
AbstractA P⩾3-factor F of a graph G is a spanning subgraph of G such that every component of F is a ...
AbstractWe present some conditions for the existence of a (g,f)-factor or a (g,f)-parity factor in a...
AbstractLet G be a connected graph of order n, a and b be integers such that 1 ≤ a ≤ b and 2 ≤ b, an...
Abstract: A (g, f)-factor of a graph is a subset F of E such that for all v ∈ V, g(v) ≤ degF(v) ≤ ...
AbstractLetGbe a graph with vertex setVand letg, f:V→Z+. We say thatGhas all (g, f)-factors ifGhas a...
AbstractWe prove the following theorem: Let G be a graph with vertex-set V and ƒ, g be two integer-v...
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
AbstractWe simplify the criterion of Lovász for the existence of a (g, ƒ)-factor when g < ƒ, or when...
AbstractWe give sufficient conditions for a graph to have a (g, f)-factor. For example, we prove tha...
AbstractA relationship is considered between an f-factor of a graph and that of its vertex-deleted s...
In this thesis, we deal with a problem of factors in graphs.First, we consider a relationship betwee...
AbstractFor a set {A, B, C, …} of graphs, an {A, B, C, …}-factor of a graph G is defined to be a spa...
AbstractLet 1≤a<b be integers and G a graph of order n sufficiently large for a and b. Then G has an...
AbstractTwo criteria for a tree to have an f-factor and (g,f)-factors are presented, respectively. T...
AbstractLet G be a graph with vertex set V(G). A spanning subgraph F of G is called a [k,k+1]-factor...
AbstractA P⩾3-factor F of a graph G is a spanning subgraph of G such that every component of F is a ...
AbstractWe present some conditions for the existence of a (g,f)-factor or a (g,f)-parity factor in a...
AbstractLet G be a connected graph of order n, a and b be integers such that 1 ≤ a ≤ b and 2 ≤ b, an...
Abstract: A (g, f)-factor of a graph is a subset F of E such that for all v ∈ V, g(v) ≤ degF(v) ≤ ...
DOI
Add to ORKG