Chapter 5 - Euler Circuits (16 questions)
Adjacent edges
Adjacent vertices
Bridge
Circuit
Connected Graph
Degree of a vertex
Disconnected Graph
Edge
Euler circuit
Euler circuit problem
Eulerization of a graph
Euler path
Euler's Theorems
Even vertex
Graph
Graph model
Length of a path or circuit
Multiple Edges
Odd vertex
Path
Routing problems
Semi-eulerization
Unicursal tracing
Vertex
Page 185 # 1 - 11 odd, 17 - 23 odd, 37 - 47 odd, 58
Chapter 6 - The Traveling Salesman Problem (9 questions)
Approximate Algorithm
Algorithm
Brute-force Algorithm
Cheapest-link Algorithm
Complete graph
Complete weighted graph
Efficient algorithm
Factorial
Inefficient algorithm
Nearest-neighbor algorithm
Optimal algorithm
Repetitive nearest-neighbor algorithm
Traveling salesman problem
Weighted graph
Weight
Page 221 # 1 - 15odd, 23 - 49 odd