Help


from Wikipedia
« »  
Formally, a vertex cover of a graph G is a set C of vertices such that each edge of G is incident to at least one vertex in C. The set C is said to cover the edges of G. The following figure shows examples of vertex covers in two graphs ( and the set C is marked with red ).

1.966 seconds.