A path of a graph is said to be ______ if it contains all the edges of the graph.

• A. eulerian
• B. hamiltonian
• C. tournament
• D. planar