Let m, n, r and ki (1 <= i <= m) be positive integers with n <= m and k(1) >= k(2) = ... = k(m) >= 2r - 1. Let G be a graph, and let H-1, H-2, ... , Hr be vertex-disjoint n-subgraphs of G. It is verified in this article that every [0, k(1) + k(2) + ... + k(m-n) + 1]-graph G includes a subgraph R such that R has a [0, k(i)] n(1) -factorization orthogonal to every Hi, 1 <= i <= r.
机构:
Jiangsu Univ Sci & Technol, Sch Math & Phys, Zhenjiang 212003, Jiangsu, Peoples R ChinaJiangsu Univ Sci & Technol, Sch Math & Phys, Zhenjiang 212003, Jiangsu, Peoples R China
Zhou, Sizhong
Zong, Minggang
论文数: 0引用数: 0
h-index: 0
机构:
Jiangsu Univ, Fac Sci, Zhejiang 212013, Jiangsu, Peoples R ChinaJiangsu Univ Sci & Technol, Sch Math & Phys, Zhenjiang 212003, Jiangsu, Peoples R China