I have done the first part but not sure if the second part is possible either as a Hamilton circuit or Euler circuit. If you could PM me any advice I would appreciate it.

The part I need help on is part (B)





[Edited on July 31, 2007 at 2:26 PM. Reason : .]

7/31/2007 2:24:08 PM

looks like i need help with uploading images as well. Go to my gallery and they can be viewed better.

Thanks

7/31/2007 2:26:50 PM

you can easily find your answers by counting the number of vertices -

"A connected multigraph has a Euler circuit if and only if each of its vertices has an even degree" - "A connected multipgraph has a Euler path but not a Euler circuit if and only if it has exactly two vertices of odd degree" - "If G is a conected simple graph with n vertices where n >=3, then G has a Hamilton circuit if the degree of each vertex is at least n/2"

7/31/2007 3:41:21 PM