A

Admin • 828.03K Points
Coach

Q. 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

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.