CprE 310, Practice Problems on Graphs (Second set), Fall 2002

Date: 12/16/02

1) Hamilton Paths: Recall the definition of a Hamilton Path and
Circuit & the difference between Euler Paths and Hamilton Paths.

While there is a very simple way to recognize if a graph has an Euler Path,
there is no such criterion for Hamilton Paths.

  - Try to solve the problem in page 482, figure 8 by yourself, 
    without looking at the solution

  - Page 487, problem 40

  - Page 488, problem 45. Does this graph have a Hamilton Path? 
    A Hamilton Circuit?


2)Spanning Trees, DFS (depth first search), BFS (breadth first search)

 - Page 578, problems 1, 3
 
 - Page 579, problem 13. Draw the BFS and DFS spanning trees for this graph,
   starting from vertex a

 - Page 579, problems 18,19

 - Page 580, problems 21, 22


3)Bipartite graphs

 - Page 455, problems 15, 16
 
 - Page 456, problem 36