A New Result on Alspach's Problem
暂无分享,去创建一个
Abstract. Let G be a simple graph. Let g(x) and f(x) be integer-valued functions defined on V(G) with g(x)≥2 and f(x)≥5 for all x∈V(G). It is proved that if G is an (mg+m−1, mf−m+1)-graph and H is a subgraph of G with m edges, then there exists a (g,f)-factorization of G orthogonal to H.
[1] Douglas R Stinson,et al. Contemporary design theory : a collection of surveys , 1992 .
[2] Guiying Yan,et al. Orthogonal [k − 1, k + 1]-factorizations in graphs , 1996 .