This is an old revision of this page, as edited by Dorbec(talk | contribs) at 17:31, 11 February 2020([Relationship with vertex/edge-cover]). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 17:31, 11 February 2020 by Dorbec(talk | contribs)([Relationship with vertex/edge-cover])
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
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)[reply]
