MO640 - Multiple-choice question
Which of the phrases below is correct?
A) Both problems of (A) recognizing Hamiltonian graphs and (B) recognizing Eulerian graphs are NP - Complete problems.
B) There aren't graphs that admit both a Hamiltonian cycle and an Eulerian tour simultaneously.
C) Eulerian and Hamiltonian graphs are necessarily connected graphs.
D) The Travelling Salesman Problem (TSP) is a particular case of the problem of finding a Hamiltonian cycle.
E) None of the above
Original idea by: Roberto Hiroshi Higa
Translation help by: Rafael S. Padilha
No comments:
Post a Comment