Chapter 14.3, Problem 2E

(a)

To determine

Whether path $\text{A}\to \text{B}\to \text{C}\to \text{D}\to \text{E}\to \text{C}\to \text{A}\to \text{E}\to \text{F}\to \text{A}$ is Hamilton circuit or not. Hamilton circuit is the path that visits each vertex exactly once.

(b)

To determine

Whether path $\text{A}\to \text{C}\to \text{D}\to \text{E}\to \text{F}\to \text{A}$ is Hamilton circuit or not.

(c)

To determine

Whether path $\text{F}\to \text{A}\to \text{C}\to \text{E}\to \text{F}$ is Hamilton circuit or not.

(d)

To determine

Whether path $\text{C}\to \text{D}\to \text{E}\to \text{F}\to \text{A}\to \text{B}$ is Hamilton circuit or not.