Title: Graphs Vocabulary

Q: Path
A: A walk with no repeated edge.

Q: Circuit
A: A closed walk with no repeated edge.

Q: Euler path
A: An Euler path includes every edge exactly once

Q: Hamilton path
A: A Hamilton path includes every vertex exactly once

Q: Hamilton circuit
A: A Hamilton circuit is a circuit which includes every vertex exactly once

Q: Eulerian Circuit
A: An Eulerian circuit includes every edge exactly once (+Circuit)

Q: Simple path
A: A path (no repeated edge) with no repeated vertices.

Q: Simple circuit
A: A circuit (no repeated edge) with no repeated vertices.