Funder
Agence Nationale de la Recherche
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference17 articles.
1. Treewidth and pathwidth of permutation graphs;Bodlaender;SIAM J. Discrete Math.,1995
2. Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond, Enumerating minimal dominating sets in triangle-free graphs, in: STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 16:1–16:12.
3. Graph Theory;Bondy,2008
4. Personal communication;Boros,2016
5. Minimal dominating sets in graph classes: Combinatorial bounds and enumeration;Couturier;Theoret. Comput. Sci.,2013