Abstract
LetG be a simple graph. Letg(x) andf(x) be integer-valued functions defined onV(G) withf(x)≥g(x)≥1 for allxεV(G). It is proved that ifG is an (mg+m−1,mf−m+1)-graph andH is a [1,2]-subgraph withm edges, then there exists a (g,f)-factorization ofG orthogonal toH.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. Lovasz. Subgraph with Prescribed Valencies.J. Comb. Theory, 1970, 8: 391–416.
B. Alspach, Heinrich and Liu Guizhen. Contemporary Design Theory: A Collection of Surveys. John Wiley & Sons. Inc., New York, 1992, 13–37.
Liu Guizhen. (g,f)-factorizations of Graphs Orthogonal to anm-star.Science in China (Series A), 1995, 38(7): 805–812.
Liu Guizhen. Orthogonal (g,f)-factorizations in Graphs.Discrete Math., 1995, (43): 153–158.
Author information
Authors and Affiliations
Additional information
This work is supported by China Postdoctoral Science Foundation and Shandong Youth Science Foundation.
Rights and permissions
About this article
Cite this article
Yan, G. (g,f)-Factorizations of graphs orthogonal to [1,2]-subgraph. Acta Mathematicae Applicatae Sinica 13, 371–375 (1997). https://doi.org/10.1007/BF02009545
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02009545