Enumeration of some families of chordal graphs
Jordi Castellvi (Univ. Barcelone)A 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 sepa...
Le séminaire a lieu le mardi à 10h45 (sauf modification exceptionnelle), au campus Côte de Nacre, bâtiment Sciences 3, salle S3 351, 3ème étage.
Séminaires à venir :
Commit graphs in Version-Control Systems: incremental reachability and label discovery
Euxane Tran-Girard (LIGM, Univ. Paris-Est G. Eiffel)Current distributed source version-control systems (such as Git and Mercurial), track the history of changes using an append-only directed acyclic graph, som...
Titre à venir
Joan Thibault (IRISA, Rennes)Résumé à venir.
Titre à venir
Naima Mehdi (LIP6, Sorbonne Univ.)Résumé à venir.
Fractional domatic number and minimum degree
Demaret Hugo (Ecole Polytechnique et GREYC)The domatic number of a graph \(G\) is the maximum number of pairwise disjoint dominating sets of \(G\). We are interested in the LP-relaxation of this param...