A note on line coverings of graphs

Let minimum, maximum, refer to the number of elements in a set and let minimal, maximal refer to set inclusion. It is shown that a minimal cover of a graph is minimum if and only if it contains a maximum matching of that graph; a maximal matching of a graph is maximum if and only if it is contained in a minimum cover of that graph diminished by the set of its isolated points.