H. Arimura and T. Uno, Polynomial-delay and polynomial-space algorithms for mining closed sequences, graphs, and pictures in accessible set systems, Proceedings of the 2009 SIAM International Conference on Data Mining, pp.1088-1099, 2009.

M. Bonamy, O. Defrain, M. Heinrich, M. Pilipczuk, and J. Raymond, Enumerating minimal dominating sets in Kt-free graphs and variants, 2019.

M. Bonamy, O. Defrain, M. Heinrich, and J. Raymond, Enumerating minimal dominating sets in triangle-free graphs, 36th International Symposium on Theoretical Aspects of Computer Science, vol.16, pp.1-16, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02181721

E. Boros, K. Elbassioni, V. Gurvich, and L. Khachiyan, Generating maximal independent sets for hypergraphs with bounded edge-intersections, Latin American Symposium on Theoretical Informatics, pp.488-498, 2004.

B. Courcelle, Linear delay enumeration and monadic second-order logic, Discrete Applied Mathematics, vol.157, issue.12, pp.2675-2700, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00333846

N. Creignou, M. Kröll, R. Pichler, S. Skritek, and H. Vollmer, A complexity theory for hard enumeration problems, Discrete Applied Mathematics, 2019.

T. Eiter, G. Gottlob, and K. Makino, New results on monotone dualization and generating hypergraph transversals, SIAM Journal on Computing, vol.32, issue.2, pp.514-537, 2003.

L. Michael, L. Fredman, and . Khachiyan, On the complexity of dualization of monotone disjunctive normal forms, Journal of Algorithms, vol.21, issue.3, pp.618-628, 1996.

P. A. Golovach, P. Heggernes, M. Mamadou, D. Kanté, Y. Kratsch et al., Enumerating minimal dominating sets in chordal bipartite graphs, Discrete Applied Mathematics, vol.199, pp.30-36, 2016.
URL : https://hal.archives-ouvertes.fr/hal-02083515

D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou, On generating all maximal independent sets, Information Processing Letters, vol.27, issue.3, pp.119-123, 1988.

M. Mamadou, V. Kanté, A. Limouzy, L. Mary, and . Nourine, On the neighbourhood helly of some graph classes and applications to the enumeration of minimal dominating sets, International Symposium on Algorithms and Computation, pp.289-298, 2012.

M. Mamadou, V. Kanté, A. Limouzy, L. Mary, and . Nourine, On the enumeration of minimal dominating sets and related notions, SIAM Journal on Discrete Mathematics, vol.28, issue.4, pp.1916-1929, 2014.

M. Mamadou, V. Kanté, A. Limouzy, L. Mary, T. Nourine et al., A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs, International Workshop on Graph-Theoretic Concepts in Computer Science, pp.138-153, 2015.

M. Mamadou, V. Kanté, A. Limouzy, L. Mary, T. Nourine et al., Polynomial delay algorithm for listing minimal edge dominating sets in graphs, Workshop on Algorithms and Data Structures, pp.446-457, 2015.

C. Ronald, R. E. Read, and . Tarjan, Bounds on backtrack algorithms for listing cycles, paths, and spanning trees, Networks, vol.5, issue.3, pp.237-252, 1975.

Y. Strozecki and A. Mary, Efficient enumeration of solutions produced by closure operations, Discrete Mathematics & Theoretical Computer Science, vol.21, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02373737

E. S. Wolk, The comparability graph of a tree, Proceedings of the American Mathematical Society, vol.13, issue.5, pp.789-795, 1962.