(g, f)-factorizations orthogonal to a subgraph in graphs
暂无分享,去创建一个
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.
[1] László Lovász,et al. Subgraphs with prescribed valencies , 1970 .
[2] Dominique Sotteau,et al. On the existence of a matching orthogonal to a 2-factorization , 1989, Discret. Math..
[3] Guizhen Liu. Orthogonal (g, f)-factorizations in graphs , 1995, Discret. Math..
[4] J. A. Bondy,et al. Graph Theory with Applications , 1978 .