ven. 07 avril 2023 -- Cléophée Robin (Wilfrid Laurier University, Waterloo (Canada))

summary: A graph G is Hamiltonian if there exists a cycle in G containing all vertices of G exactly once. A graph G is t-tough if, for all subsets of vertices S, the number of connected components in G−S is at most |S|/t. We extended the theorem of ...