Abstract
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.
Publisher
Cambridge University Press (CUP)
Reference11 articles.
1. [9] Zhou S. and Xue X. , ‘(g, f)-factors of graphs with prescribed properties’, J. Systems Sci. Math. Sci. (to appear).
2. Subgraphs with prescribed valencies
3. Fractional ( g, f )-factors of graphs
4. [11] Zhou S. , ‘Randomly r-orthogonal (0, f)-factorizations of bipartite (0, mf − (m − 1) r)-graphs’, Ars Combin. (to appear).
5. Graph Theory with Applications
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献