-
41浏览
-
0点赞
-
0收藏
-
0分享
-
91下载
-
0评论
-
引用
期刊论文
Sufficient Conditions for n-Matchable Graphs
,-0001,():
Let n be a non-negative integer. A graph G is said to be n-matchable if the subgraph G−S has a perfect matching for any subset S of V (G) with |S|=n. In this paper, we obtain sufficient conditions for different classes of graphs to be nmatchable. Since 2k-matchable graphs must be k-extendable, we have generalized the results about k-extendable graphs. All results in this paper are sharp.
【免责声明】以下全部内容由[于青林]上传于[2006年02月16日 18时20分04秒],版权归原创者所有。本文仅代表作者本人观点,与本网站无关。本网站对文中陈述、观点判断保持中立,不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考,并请自行承担全部责任。
本学者其他成果
同领域成果