Enumerating minimal connected dominating sets in graphs of bounded chordality

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch. Enumerating minimal connected dominating sets in graphs of bounded chordality. Theoretical Computer Science, 630:63-75, 2016. [doi]

@article{GolovachHK16,
  title = {Enumerating minimal connected dominating sets in graphs of bounded chordality},
  author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch},
  year = {2016},
  doi = {10.1016/j.tcs.2016.03.026},
  url = {http://dx.doi.org/10.1016/j.tcs.2016.03.026},
  researchr = {https://researchr.org/publication/GolovachHK16},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {630},
  pages = {63-75},
}