Chargement de la vue.
Séminaire Algorithmique : « Enumeration of some families of chordal graphs », Jordi Castellvi (Univ. Barcelone, Espagne)
Sciences 3- S3 351A graph is chordal if it has no induced cycle of length greater than 3. Alternatively, Dirac proved that a graph is chordal if and only if every minimal separator … Continue reading Séminaire Algorithmique : « Enumeration of some families of chordal graphs », Jordi Castellvi (Univ. Barcelone, Espagne)