若图G的每个极小H-覆盖都是它的最小H-覆盖,则称图G为H-等可覆盖的.得出了M2-等可覆盖图的必要条件,并刻画了以下几类特殊M2-等可覆盖图的特征:匹配、路、圈、完全图、完全二部图、轮图和扇图.
A graph G is H-equicoverable if every minimal H-covering in G is also its minimum H-covering. In this paper, necessary conditions for M2-equicoverable graphs are provided and several special M2-equicoverable graphs are characterized. They are matching, path, cycle, complete graph, complete bipartite graph, wheel and fan.