Packing many dominating sets in a graph
François Pirot (LISN, Univ. Paris-Saclay)Given a graph G, a dominating set of G is a subset of vertices S such that every vertex not in S is adjacent to at least one vertex in S; that is, NG[S] = V(...
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.
Given a graph G, a dominating set of G is a subset of vertices S such that every vertex not in S is adjacent to at least one vertex in S; that is, NG[S] = V(...
Résumé à venir.
Résumé à venir.