Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Dalwadi, Aditya Y"'
For most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs -- that is, connected nontrivial graphs with the property that each edge belongs to some perfect matching. There is extensive literature on these
Externí odkaz:
http://arxiv.org/abs/2405.15416
