Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets

Michael Dorfling, Wayne Goddard, Johannes H. Hattingh, Michael A. Henning. Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets. Discrete Mathematics, 300(1-3):82-90, 2005. [doi]

@article{DorflingGHH05,
  title = {Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets},
  author = {Michael Dorfling and Wayne Goddard and Johannes H. Hattingh and Michael A. Henning},
  year = {2005},
  doi = {10.1016/j.disc.2005.06.020},
  url = {http://dx.doi.org/10.1016/j.disc.2005.06.020},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/DorflingGHH05},
  cites = {0},
  citedby = {0},
  journal = {Discrete Mathematics},
  volume = {300},
  number = {1-3},
  pages = {82-90},
}