Torralbo Lezana, Manuel (2021-10-08)
[EN] Given a graph, the Hamiltonian cycle problem (HCP) consists of finding a cycle in a given graph that passes through every single vertex exactly once, or determining that this cannot be achieved. This problem has several ...