AI Chat AI Image Generator AI Video Text to Speech

Blocking dominating sets for H-free graphs via edge contractions

06/28/2019

∙

by Esther Galby, et al.

∙

∙

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 coNP-hard when restricted to subcubic claw-free graphs and P_7-free graphs.

Esther Galby
21 publications
Paloma T. Lima
20 publications
Bernard Ries
21 publications

page 1

page 2

page 3

page 4

research

∙ 10/27/2020

Reducing the domination number of P_3+kP_2-free graphs via one edge contraction

In this note, we consider the following problem: given a connected graph...

0 Esther Galby, et al. ∙

research

∙ 09/18/2020

Blocking total dominating sets via edge contractions

In this paper, we study the problem of deciding whether the total domina...

0 Esther Galby, et al. ∙

research

∙ 02/17/2022

Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number

We consider the following problem: for a given graph G and two integers ...

0 Felicia Lucke, et al. ∙

research

∙ 05/25/2022

The complexity of blocking (semi)total dominating sets with edge contractions

We consider the problem of reducing the (semi)total domination number of...

0 Esther Galby, et al. ∙

research

∙ 06/10/2021

Edge Domination Number and the Number of Minimum Edge Dominating Sets in Pseudofractal Scale-Free Web and Sierpiński Gasket

As a fundamental research object, the minimum edge dominating set (MEDS)...

0 Xiaotian Zhou, et al. ∙

research

∙ 03/05/2019

Reducing the domination number of graphs via edge contractions

In this paper, we study the following problem: given a connected graph G...

0 Esther Galby, et al. ∙

research

∙ 10/19/2022

Reducing Graph Parameters by Contractions and Deletions

We consider the following problem: for a given graph G and two integers ...

0 Felicia Lucke, et al. ∙