A minimal edge cover is an edge cover of a graph that does not contain any other edge cover as a proper subset.
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 does not contain any other edge cover as a proper subset.
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 Resource. https://mathworld.wolfram.com/MinimalEdgeCover.html