摘要
设G是一个图,F={F_1,F_2,…,F_d}是G的一个因子分解,H是C的一个子图,若H有d条边且恰好与每个F_i有一条公共边,则称H与F是正交的。本文研究了与图的K-因子分解正交的对集及[a,b]-子图,从而证明了关于因子分解问题的两个猜想在某些情况下成立,并提出了可进一步研究的问题。
Let G be a graph and let F = {F1, F2,… ,Fd} and H be a factorization and a subgraph of G, respectively. If H with d edges has exactly one edge in common with Fi, then we say that H is orthogonal with F. In this paper matchings and [a,b]-subgraphs which are orthogonal with a k-factorization of a graph are discussed. Therefore two conjectures on orthogonal factorizations are proved under some conditions and some open problems are given.
出处
《数学进展》
CSCD
北大核心
1992年第2期211-215,共5页
Advances in Mathematics（China）
