edge covering

An edge cover is a subset of edges defined similarly to the vertex cover, namely a collection of graph edges such that the union of edge endpoints corresponds to the entire vertex set of the graph. Therefore, only graphs with no isolated points have an edge cover. A graph can be tested in the Wolfram Language to see if it is an edge cover of a given graph using EdgeCoverQ[g]. Precomputed edge covers for many named graphs can be looked up using GraphData[graph, EdgeCovers].

edge cover number | edge cover polynomial | maximum independent edge set | minimal edge cover | minimum edge cover | vertex cover