Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH scholarly article en Galby, Esther; Lima, Paloma T.; Ries, Bernard http://www.dagstuhl.de/lipics License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-115171
URL:

; ;

Blocking Dominating Sets for H-Free Graphs via Edge Contractions

pdf-format:


Abstract

In this paper, we consider the following problem: given a connected graph G, can we reduce the domination number of G by one by using only one edge contraction? We show that the problem is NP-hard when restricted to {P_6,P_4+P_2}-free graphs and that it is coNP-hard when restricted to subcubic claw-free graphs and 2P_3-free graphs. As a consequence, we are able to establish a complexity dichotomy for the problem on H-free graphs when H is connected.

BibTeX - Entry

@InProceedings{galby_et_al:LIPIcs:2019:11517,
  author =	{Esther Galby and Paloma T. Lima and Bernard Ries},
  title =	{{Blocking Dominating Sets for H-Free Graphs via Edge Contractions}},
  booktitle =	{30th International Symposium on Algorithms and Computation (ISAAC 2019)},
  pages =	{21:1--21:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-130-6},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{149},
  editor =	{Pinyan Lu and Guochuan Zhang},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2019/11517},
  URN =		{urn:nbn:de:0030-drops-115171},
  doi =		{10.4230/LIPIcs.ISAAC.2019.21},
  annote =	{Keywords: domination number, blocker problem, H-free graphs}
}

Keywords: domination number, blocker problem, H-free graphs
Seminar: 30th International Symposium on Algorithms and Computation (ISAAC 2019)
Issue date: 2019
Date of publication: 2019


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI