Consider the following graph properties and sign which statements are TRUE:
I - A Hamiltonian cycle can be converted to a Hamiltonian path by removing one of its edges.
II - A connected graph in which a vertex has odd degree can 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, II
b. I, III
c. II, III
d. AotA
e. NotA
Original idea by: Raphael Cristofaro
Nenhum comentário:
Postar um comentário