A path in graph G, which contains every vertex of Maths 0 Ravi Garg 3 Rep. December 13, 2015 A path in graph G, which contains every vertex of G once and only once ? a. Eulertour b. Hamiltonian Path c. Euler trail d. Hamiltonian tour Ravi Garg edited question January 14, 2016 1 answer ActiveVotedNewestOldest 0 Sonali Kapoor (anonymous) January 7, 2016 correct option B Sonali Kapoor answered January 7, 2016 Toggle fullscreen Write Add image to editor add image from link NamePost answer Follow 1 Question stats ActiveJanuary 14, 2016Views282 timesAnswers1 answerFollowers1 follower Question and answer is powered by AnsPress