A ______ in a graph G is a circuit which consists of every vertex (except first/last vertex) of G exactly once.

• A. Euler path
• B. Hamiltonian path
• C. Planar graph
• D. Path complement graph