0
0

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?

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?
1). Hamiltonian
2). Planar
3). Isomorphic
4). Euler

This Question has 1 answers.

If some closed walk in a graph contains all the edges then the walk is called Euler.

Add Answer / Comment

Captcha Image