Talk:Covering graph

Relationship with vertex/edge-cover

Latest comment: 6 years ago1 comment1 person in discussion

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

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.