|
|
|
|
|
Fatemeh Keshavarz-Kohjerdi and Ruo-Wei Hung
A graph is called Hamiltonian connected if it contains a Hamiltonian path between any two distinct vertices. In the past, we proved the Hamiltonian path and cycle problems for general supergrid graphs to be NP-complete. However, they are still open for s...
ver más
|
|
|
|
|