Abstract
Simple graphs are considered. Let G be a graph andg(x) andf(x) integer-valued functions defined on V(G) withg(x)⩽f(x) for everyxɛV(G). For a subgraphH ofG and a factorizationF=|F 1,F 2,⃛,F 1| ofG, if |E(H)∩E(F 1)|=1,1⩽i⩽j, then we say thatF orthogonal toH. It is proved that for an (mg(x)+k,mf(x) -k)-graphG, there exists a subgraphR ofG such that for any subgraphH ofG with |E(H)|=k,R has a (g,f)-factorization orthogonal toH, where 1⩽k<m andg(x)⩾1 orf(x)⩾5 for everyxɛV(G).
Similar content being viewed by others
References
Heinrich, B. A., Liu Guizhen,Contemporary Design Theory: A Collection of Surveys, New York: John Wiley and Sons 1992, 13–37.
Liu Guizhen,(g, f)-factorizations of graphs orthogonal tom-star,Science in China, (in Chinese) Ser. A, 1995, 25(4): 367.
Liu Guizhen, Orthogonal(g, f)-factorizations in graphs,Discrete Math., 1995, 43: 153.
Liu Guizhen, Orthogonal[k - 1,k +1]-factorizations in graphs,J. Statistical Planning and Inference, 1996, 51: 195.
Author information
Authors and Affiliations
Additional information
Project supported by the Chitia Postdoctoral Science Foundation and Chuang Xin Foundation of the Chinese Academy of Sciences.
Rights and permissions
About this article
Cite this article
Guiying, Y., Jiaofeng, P. Existence of subgraph with orthogonal (g,f)-factorization. Sci. China Ser. A-Math. 41, 48–54 (1998). https://doi.org/10.1007/BF02900771
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02900771