A minimal edge cover is an edge cover of a graph that is not a proper subset of any other edge cover.
Every minimum edge cover is a minimal edge cover, but the converse does not necessarily hold.
A minimal edge cover is an edge cover of a graph that is not a proper subset of any other edge cover.
Every minimum edge cover is a minimal edge cover, but the converse does not necessarily hold.
Weisstein, Eric W. "Minimal Edge Cover." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/MinimalEdgeCover.html