摘要
本文讨论图存在完美伍配的充要条件,并证明一个定理。最后,给出一个求完美伍配的算法。
This paper discusses the sufficient and necessary condition of perfect multi—matching in a graph and proves theorem,that the Tutte's theorem can be regarded as its apecical case.Finally, the calculus of the porfect multi—matching in a graph is given out.
关键词
图
图论
完美伍配
通路
graph
perfect multi—matching
path