Page 276, Exercise 1
Since the degree of each vertex is even, there must be an Eulerian walk. One such walk is:
PATH: (4,3) (3,4), (4,1) (1,2), (2,1),(1,3),(3,4).