Hamiltonian connected graph
Материал из WEGA
Hamiltonian connected graph --- гамильтоново-связный граф.
A graph [math]\displaystyle{ G }[/math] is Hamiltonian connected if there is a hamiltonian chain joining every pair of vertices in the graph.
Hamiltonian connected graph --- гамильтоново-связный граф.
A graph [math]\displaystyle{ G }[/math] is Hamiltonian connected if there is a hamiltonian chain joining every pair of vertices in the graph.