007-2015

MO640 - Multiple-choice question

Consider the following statements and mark the alternative listing all the FALSE statements:

I - A Hamiltonian cycle can be converted to a Hamiltonian path by removing one of its edges.
II - There is a connected graph in which a vertex has odd degree and for which we have an Eulerian cycle.
III - A cycle graph (a graph that consists of a single Eulerian and Hamiltonian cycle) that has an even number of vertices is bipartite.

a. I
b. II
c. III
d. more than one statement above is FALSE
e. None of the Above

Original idea by: Raphael Cristofaro