关于[a,b]界f-因子的一个充分条件

A Sufficient Condition for [a,b]-bounded f-factors of Graphs

对图因子的研究是图论的重要分支,目前已有许多的结果.近年来,随着正则因子的研究发展,[a,b]界f-因子也开始发展起来,本文进一步研究了简单图的顶点度和f-因子的关系,给出了有关不邻接点的度和作为存在f-因子的一个充分条件.

In this paper, we mainly consider the relationship between the existence of factors and degrees of vertices. Then we give a sufficient condition on the existence of factors in graphs.