-
106浏览
-
0点赞
-
0收藏
-
0分享
-
117下载
-
0评论
-
引用
期刊论文
Ore-type Conditions for the Existence of k-factors with Prescribed Properties
,-0001,():
Let G be a graph of order n≥4k+1, where k is a positive integer with kn even and δ(G)≥k. We prove that if the degree sum of each pair of nonadjacent ertices is at least n+1, then G has a k-factor including any given edge. Similarly, a sufficient condition for graphs to have a k-factor excluding any given edge is also given.
【免责声明】以下全部内容由[于青林]上传于[2006年02月16日 18时20分58秒],版权归原创者所有。本文仅代表作者本人观点,与本网站无关。本网站对文中陈述、观点判断保持中立,不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考,并请自行承担全部责任。
本学者其他成果
同领域成果