# Vertex cover of a given size
Last edited: 2023-11-11
# Statement
Vertex cover of a given size
Given an undirected graph $G = (V,E)$ and a positive integer $g > 0$, is there a vertex cover using at most $g$ vertices, if so what is it?
Last edited: 2023-11-11
Given an undirected graph $G = (V,E)$ and a positive integer $g > 0$, is there a vertex cover using at most $g$ vertices, if so what is it?