|
|
|
|
|
Asahi Takaoka
The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles ??0
C
0
and ????
C
t
of a graph G, whether there is a sequence of Hamiltonian cycles ??0,??1,?,????
C
0
,
C
1
,
?
,
C
t
such that ????
C
i
can be obtained from ????-1
C
...
ver más
|
|
|
|
|