Edge Covering
Computer Science
Level
1
A
B
C
None of the above
More than one graph shows an edge cover
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
Graph A is the only graph where a red edge touches every vertex. In graph B, all corner nodes are not connected to a red edge, and in graph C, the bottom right node is not connected to a red edge.