Subgraphs with Orthogonal [0, ki]1n-Factorizations in Graphs

被引：0
作者：
Zhou, Sizhong [1 ]
Zhang, Tao [2 ]
Xu, Zurun [1 ]
机构：
[1] Jiangsu Univ Sci & Technol, Sch Math & Phys, Mengxi Rd 2, Zhenjiang 212003, Jiangsu, Peoples R China
[2] Jiangsu Univ Sci & Technol, Sch Econ & Management, Mengxi Rd 2, Zhenjiang 212003, Jiangsu, Peoples R China
来源：
ALGORITHMS AND DISCRETE APPLIED MATHEMATICS | 2017年 / 10156卷
基金：
中国国家自然科学基金;
关键词：
Graph; Subgraph; Factor; 0; ki](1)(m)-Factorization; Orthogonal; (G; F)-FACTORIZATIONS; SUBDIGRAPHS; NETWORKS;
D O I：
10.1007/978-3-319-53007-9_32
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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.
引用
收藏
页码：362 / 370
页数：9
相关论文
共 13 条
12