Hostname: page-component-7bb8b95d7b-2h6rp Total loading time: 0 Render date: 2024-09-12T02:17:59.019Z Has data issue: false hasContentIssue false
  • English
  • Français

Some sufficient conditions for graphs to have (g, f)-factors

Published online by Cambridge University Press:  17 April 2009

Sizhong Zhou
Sizhong Zhou
Affiliation:
School of Mathematics and Physics, Jiangsu University of Science and Technology, Zhenjiang, Jiangsu 212003, People's Republic of China, e-mail: zsz_cumt@163.com
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 75 , Issue 3 , June 2007 , pp. 447 - 452
Copyright
Copyright © Australian Mathematical Society 2007

References

[1]Bondy, J.A. and Murty, U.S.R., Graph theory with applications (The Macmillan Press, London, 1976).Google Scholar
[2]Kouider, M. and Mahéo, M., ‘Two edge connected [2, k] -factors in graphs’, J. Combin. Math. Combin. Comput. 35 (2000), 89–95.Google Scholar
[3]Kouider, M. and Mahéo, M., ‘Connected [a, b] -factors in graphs’, Combinatorica 22 (2002), 71–82.Google Scholar
[4]Liu, G., ‘(g < f)-factors of graphs’, Acta Math. Sci. (China) 14 (1994), 285–290.Google Scholar
[5]Liu, G. and Zhang, L., ‘Maximum fractional (0, f)-factors of graphs’, Math. Appl. (Wuhan) 13 (2000), 31–35.Google Scholar
[6]Liu, G. and Zhang, L., ‘Fractional (g, f)-factors of graphs’, Acta Math. Sci. Ser. B. Engl. Ed. 21 (2001), 541–545.Google Scholar
[7]Lovász, L., ‘Subgraphs with prescribed valencies’, J. Combinational Theory 8 (1970), 391–416.Google Scholar
[8]Matsuda, H., ‘Fan-type results for the existence of [a, b] -factors’, Discrete Math. 306 (2006), 688–693.Google Scholar
[9]Zhou, S. and Xue, X., ‘(g, f)-factors of graphs with prescribed properties’, J. Systems Sci. Math. Sci. (to appear).Google Scholar
[10]Zhou, S. and Xue, X., ‘Complete-factors and (g, f)-covered graphs’, Australas. J. Combin. 37 (2007), 265–269.Google Scholar
[11]Zhou, S., ‘Randomly r-orthogonal (0, f)-factorizations of bipartite (0, mf − (m − 1) r)-graphs’, Ars Combin. (to appear).Google Scholar