Let be a simple, undirected graph. A vertex cover of is a subset such that for every , or . Let the size of the smallest vertex cover in be . Let be any vertex cover of size .
For a vertex , which of the following constraints will always ensure that ?
- AThe degree of is at least
- BThe vertex is on a path of length
- CThe vertex is on a cycle of length
- DThe vertex is a part of a clique of size

