Some sufficient conditions for graphs to have (g, f)-factors
Sizhong Zhou · Bulletin of the Australian Mathematical Society · 2007
Suppose that G is a graph with vertex set V (G) and edge set E (G), and let g and f be two non-negative integer-valued functions defined on V (G) such that g (x) ≤ f (x) for each x ∈ V (G). A (g, f)-factor of G is a spanning subgraph F of G such that g (x) ≤ dF (x) ≤ f (x) for each x ∈ V (F). In this paper, some sufficient conditions for a graph to have a (g, f)-factor are given.