【摘要】 设 ( g(x)和 f(x)是定义在V(G)上的整数值函数 ,且对任意的x∈V(G)有 0 g(x) <f(x)。证明了若G是一个 (mg+k,mf-k) 图 ,其中 1 k <m ,则G存在一个子图R满足对G的任一k 路P(或k 圈C) ,R有 ( g,f) 因子分解与 p(或C)正交。更多还原

【Abstract】 Let g(x) and f(x) be two integer valued functions defined on V(G) such that 0 g(x)<f(x) for every x∈V(G).In this paper,it is proved that for any k -path p (or k -cycle C )of an( mg+k,mf-k ) graph G,1k<m ,there exists a subgraph R with a ( g,f ) factorization orthogonal to P (or C ).更多还原