6.1 Hamilton Circuits and Hamilton Path
6.1 Hamilton Circuits and Hamilton Path. 6.2: Complete Graph. A Hamilton path is a path that goes through each vertex of the graph once and only once. F, A, B, E, C, G, D is a Hamilton path.
366 views • 10 slides