Abstract
LetG be a graph with vertex setV (G) and edge setE (G), and letg andf be two integer-valued functions defined on V(G) such thatg(x)⩽(x) for every vertexx ofV(G). It was conjectured that ifG is an (mg +m - 1,mf -m+1)-graph andH a subgraph ofG withm edges, thenG has a (g,f)-factorization orthogonal toH. This conjecture is proved affirmatively.
Similar content being viewed by others
References
Bondy, J. A., Murty, U. S. R.,Graph Theory with Applications, London: MacMillan, 1976.
Alspach, B., Heinrich, K., Liu, G.,Contemporary Design Theory—ACollection of Surveys, New York: John Wiley and Sons, 1992, 13–37.
Liu, G., Alspach, B., Heinrich, K., Some results on orthogonal factorizations,Advanced Mathematics, 1992, 21(2): 211
Kouider, M., Sottcau, D., On the existence of a matching orthogonal to a 2-factorization,Discrete Math., 1989, 73(3): 301.
Liu, G., (g,f)-factorization orthogonal to a star,Science in China, Ser. A, 25(4): 367.
Liu, G., Orthogonal (g, f) -factorizations in graphs,Discrete Math., 1998, 143: 153.
Lovász, L., Subgraphs with prescribed valencies,J. Combin. Theory, 1970, 8(4): 319.
Author information
Authors and Affiliations
Additional information
Project supported by the National Natural Science Foundation of China.
Rights and permissions
About this article
Cite this article
Li, G., Liu, G. (g, f)-factorizations orthogonal to a subgraph in graphs. Sci. China Ser. A-Math. 41, 267–272 (1998). https://doi.org/10.1007/BF02879045
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02879045