Add to ORKGAbstract: A (g, f)-factor of a graph is a subset F of E such that for all v ∈ V, g(v) ≤ degF(v) ≤ f(v). Lovasz gave a necessary and sufficient condition for the existence of a (g, f)-factor. We extend, to the case of edge-weighted graphs, a result of Kano and Saito who showed that if g(v) < λdegE(v) < f(v) for any λ ∈ [0,1], then a (g, f)-factor always exist. In addition, we use results of Anstee to provide new necessary and sufficient conditions for the existence of a (g, f)-factor. © 2008 Wiley Periodicals, Inc. J Graph Theory 57: 265–274, 200
This book chronicles the development of graph factors and factorizations. It pursues a comprehensive...
AbstractLet 1≤a<b be integers and G a graph of order n sufficiently large for a and b. Then G has an...
AbstractA factor F of a graph is called a complete-factor if each component of F is complete. Let G ...
A (g, f)-factor of a graph is a subset F of E such that for all v is an element of V, g(v) <= deg(F)...
A (g, f)-factor of a graph is a subset F of E such that for all v is an element of V, g(v) <= deg(F)...
AbstractWe give sufficient conditions for a graph to have a (g, f)-factor. For example, we prove tha...
AbstractWe simplify the criterion of Lovász for the existence of a (g, ƒ)-factor when g < ƒ, or when...
For integers a and b such that 0 ≤ a ≤ b, a graph G is called an [a, b]−graph if a ≤ dG(x) ≤ b for ...
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
AbstractLetGbe a graph with vertex setVand letg, f:V→Z+. We say thatGhas all (g, f)-factors ifGhas a...
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
This book chronicles the development of graph factors and factorizations. It pursues a comprehensive...
AbstractTwo criteria for a tree to have an f-factor and (g,f)-factors are presented, respectively. T...
Let a, b, k, and m be positive integers such that 1 ≤ a < b and 2 ≤ k ≤ (b + 1 − m)/a. Let G = (V...
AbstractWe simplify the criterion of Lovász for the existence of a (g, ƒ)-factor when g < ƒ, or when...
This book chronicles the development of graph factors and factorizations. It pursues a comprehensive...
AbstractLet 1≤a<b be integers and G a graph of order n sufficiently large for a and b. Then G has an...
AbstractA factor F of a graph is called a complete-factor if each component of F is complete. Let G ...
A (g, f)-factor of a graph is a subset F of E such that for all v is an element of V, g(v) <= deg(F)...
A (g, f)-factor of a graph is a subset F of E such that for all v is an element of V, g(v) <= deg(F)...
AbstractWe give sufficient conditions for a graph to have a (g, f)-factor. For example, we prove tha...
AbstractWe simplify the criterion of Lovász for the existence of a (g, ƒ)-factor when g < ƒ, or when...
For integers a and b such that 0 ≤ a ≤ b, a graph G is called an [a, b]−graph if a ≤ dG(x) ≤ b for ...
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
AbstractLetGbe a graph with vertex setVand letg, f:V→Z+. We say thatGhas all (g, f)-factors ifGhas a...
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
This book chronicles the development of graph factors and factorizations. It pursues a comprehensive...
AbstractTwo criteria for a tree to have an f-factor and (g,f)-factors are presented, respectively. T...
Let a, b, k, and m be positive integers such that 1 ≤ a < b and 2 ≤ k ≤ (b + 1 − m)/a. Let G = (V...
AbstractWe simplify the criterion of Lovász for the existence of a (g, ƒ)-factor when g < ƒ, or when...
This book chronicles the development of graph factors and factorizations. It pursues a comprehensive...
AbstractLet 1≤a<b be integers and G a graph of order n sufficiently large for a and b. Then G has an...
AbstractA factor F of a graph is called a complete-factor if each component of F is complete. Let G ...