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

1. eulerian

2. hamiltonian

3. tournament

4. planar

  • a. eulerian

Related Topics

Subscribe Now

Get All Updates & News