Vertex covering is the problem of finding a set of vertices such that all the edges of the graph are incident to at least one of the vertices in the set.


Cover for a Chimera unit cell: the nodes of both the blue set of vertices (the horizontal tile of the Chimera unit cell) and the red set (vertical tile) connect to all 16 edges of the graph.

min_weighted_vertex_cover(G[, weight, …]) Returns an approximate minimum weighted vertex cover.
min_vertex_cover(G[, sampler, lagrange]) Returns an approximate minimum vertex cover.
is_vertex_cover(G, vertex_cover) Determines whether the given set of vertices is a vertex cover of graph G.