Blocking Total Dominating Sets Via Edge Contractions
THEORETICAL COMPUTER SCIENCE（2021）
摘要
In this paper, we study the problem of deciding whether the total domination number of a given graph G can be reduced using exactly one edge contraction (called 1-EDGE CONTRACTION(gamma(t))). We focus on several graph classes and determine the computational complexity of this problem. By putting together these results, we manage to obtain a complete complexity dichotomy for H-free graphs. (C) 2021 The Authors. Published by Elsevier B.V.
更多查看译文
关键词
Total dominating set, Edge contraction, H-free graphs, Computational complexity, Blocker problem
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要