Article ID Journal Published Year Pages File Type
419619 Discrete Applied Mathematics 2013 4 Pages PDF
Abstract

Let GG be a graph with order nn and let g,f:V(G)→Ng,f:V(G)→N such that g(v)≤f(v)g(v)≤f(v) for all v∈V(G)v∈V(G). We say that GG has all fractional (g,f)(g,f)-factors if GG has a fractional pp-factor for every p:V(G)→Np:V(G)→N such that g(v)≤p(v)≤f(v)g(v)≤p(v)≤f(v) for every v∈V(G)v∈V(G). Let a

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
,