On the Algorithmic Complexity of Total Domination

This publication has 11 references indexed in Scilit:

• Domination, independent domination, and duality in strongly chordal graphs
  Discrete Applied Mathematics, 1984
• Dominating Sets in Chordal Graphs
  SIAM Journal on Computing, 1982
• On domination related concepts in Graph Theory
  Published by Springer Nature ,1981
• Total domination in graphs
  Networks, 1980
• A recognition algorithm for the intersection graphs of paths in trees
  Discrete Mathematics, 1978
• Optimum domination in weighted trees
  Information Processing Letters, 1978
• Domination of undirected graphs — A survey
  Lecture Notes in Mathematics, 1978
• Towards a theory of domination in graphs
  Networks, 1977
• A linear algorithm for the domination number of a tree
  Information Processing Letters, 1975
• The intersection graphs of subtrees in trees are exactly the chordal graphs
  Journal of Combinatorial Theory, Series B, 1974