Abstract
Let G be a graph and g, f be two nonnegative integer-valued functions defined on the vertices set V(G) of G and g≤f. A (g, f)-factor of a graph G is a spanning subgraph F of G such that g(x)≤dF(x)≤f(x) for all x∈V(G). If G itself is a (g, f)-factor, then it is said that G is a (g, f)-graph. If the edges of G can be decomposed into some edge disjoint (g, f)-factors, then it is called that G is (g, f)-factorable. In this paper, one sufficient condition for a graph to be (g, f)-factorable is given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Akiyama and M. Kano, Factors and factorizations of graphs—A survey,Journal of Graph Theory,9 (1985), 1–42.
M. Kano, [a, b]-factorization of a graph,Journal of Graph Theory,9 (1985), 129–146.
M. C. Cai, On some factor theorems of graphs,Discrete Mathematics,98 (1991), 225–229.
Ma Runnian and Bai Guoqiang, (g, f)-factorizations of graph,Acta Scientiarum Naturalium Universitatis Intramongolicae,22 (1991), 296–299. (in Chinese)
Ma Runnian, (g, f)-factors and (g, f)-factorizations of graphs,Journal of Air Force-Telecommunication Engineering Institute,14 (1992), 71–76. (in Chinese)
Liu Guizhen, (g, f)-factors and factorizations of graphs,Acta Mathematical Sinica,37 (1994), 130–137. (in Chinese)
Author information
Authors and Affiliations
Additional information
Communicated by Zhang Ruqing
Rights and permissions
About this article
Cite this article
Runnian, M., Hangshan, G. On (g, f)-factorizations of graphs. Appl Math Mech 18, 407–410 (1997). https://doi.org/10.1007/BF02457556
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02457556