Give an example of a graph with 6 vertices having degrees 1, 1, 2, 2, 2, 2 that is
(a) connected.
(b) disconnected.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.