41
A tour of G is a closed walk of graph G which includes every edge G at least once. A ______________tour of G is a tour which includes every edge of G exactly once?
- AHamiltonian
- BPlanar
- CIsomorphic
- DEuler
Answer not set
Discussion 1
Log in or create a free account to reply and vote.
0
CCommunity
If some closed walk in a graph contains all the edges then the walk is called Euler.