关于极小匹配覆盖图的一个注记
A note on minimal matching covered graphs
摘要:
一个图称为匹配覆盖图,如果它的每条边都有一个包含它的最大匹配。
英文摘要:
A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that minimal matching covered graphs contain a perfect matching.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。