Combinatorics Matchings and covers Concept
Vertex cover
Summary
A vertex cover of a graph is a set of vertices that meets every edge. Vertex covers are dual to matchings and complementary to independent sets. The node vertex cover gives the precise definition.
Further reading
- Web https://en.wikipedia.org/wiki/Vertex_cover, Definition
About this page
| Tag | 0AHKWBQSWV |
|---|---|
| URI | m2://0AHKWBQSWV |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C70, 05C69 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.