Talk:Covering graph
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Relationship with vertex/edge-cover
I just removed the sentence: | In graph theory, a covering graph may also refer to a subgraph that contains either all edges (edge cover) or all vertexes (vertex cover). Indeed, this is misleading. A vertex cover is a set of vertices hiting all edges (i.e. such that every edge is incident to a vertex in the set), an edge cover is a set of edges meeting all vertices (i.e. such that every vertex is incident to an edge in the set). Actually, a subgraph containing all vertices is a spanning subgraph. I know no such thing as a subgraph meeting all edges, maybe a induced subgraph if this is all the edges among the vertices of the subgraph. Dorbec (talk) 17:31, 11 February 2020 (UTC)