For the graph shown, give
(a) all paths of length 4 and initial vertex g. (There are eight.)
(b) all cycles of length 6 and initial vertex c. (There are eight.)
(c) a path of length 7.
(d) a walk of length 4 that is not a path.
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.