This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: vertices?-A vertex cover is a set of vertices such that for each edge in G, at least 1 vertex in the set is incident upon it. x 1 , x 2 , … x n # clauses = l # variables = m For each clause, build a triangle: x1 = T x2 = F All triangles and bars are covered. Now show that the extra edges are covered:...
View Full Document
- Spring '08
- Graph Theory, Ring, Prime number