Enumerating Minimal Dominating Sets in Triangle-Free Graphs

Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond. Enumerating Minimal Dominating Sets in Triangle-Free Graphs. In Rolf Niedermeier, Christophe Paul, editors, 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany. Volume 126 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. [doi]

@inproceedings{BonamyDHR19,
  title = {Enumerating Minimal Dominating Sets in Triangle-Free Graphs},
  author = {Marthe Bonamy and Oscar Defrain and Marc Heinrich and Jean-Florent Raymond},
  year = {2019},
  doi = {10.4230/LIPIcs.STACS.2019.16},
  url = {https://doi.org/10.4230/LIPIcs.STACS.2019.16},
  researchr = {https://researchr.org/publication/BonamyDHR19},
  cites = {0},
  citedby = {0},
  booktitle = {36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany},
  editor = {Rolf Niedermeier and Christophe Paul},
  volume = {126},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-100-9},
}