Events on: November 28, 2023

A graph G is Hamiltonian if it exists a cycle in G containing all vertices of G exactly once. A graph G is t-tough if, for all subsets of vertices … Continue reading Séminaire Algorithmique : « Tough graphs and Hamiltonian degree conditions », Cléophée Robin (GREYC, Caen)