加载中…
2007-07-13
A note on minimal matching covered graphs
V. V. Mkrtchyan
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本