科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let be a graph and be a function. We denote by the number of odd components of . We prove that if for all , then has a -factor such that, for every vertex of , if is even, then , and otherwise . This theorem is a generalization of both the -odd factor theorem and a recent result on -factors by Lu and Wang. We actually prove a result stronger than the above theorem.
- 出版日期2016-1
- 单位长江大学
