Reducing graph transversals via edge contractions

05/04/2020
by   Paloma T. Lima, et al.
0

For a graph parameter π, the Contraction(π) problem consists in, given a graph G and two positive integers k,d, deciding whether one can contract at most k edges of G to obtain a graph in which π has dropped by at least d. Galby et al. [ISAAC 2019, MFCS 2019] recently studied the case where π is the size of a minimum dominating set. We focus on graph parameters defined as the minimum size of a vertex set that hits all the occurrences of graphs in a collection H according to a fixed containment relation. We prove co-NP-hardness results under some assumptions on the graphs in H, which in particular imply that Contraction(π) is co-NP-hard even for fixed k=d=1 when π is the size of a minimum feedback vertex set or an odd cycle transversal. In sharp contrast, we show that when π is the size of a minimum vertex cover, the problem is in XP parameterized by d.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/07/2022

Reducing the Vertex Cover Number via Edge Contractions

The CONTRACTION(vc) problem takes as input a graph G on n vertices and t...
research
02/18/2020

Multistage s-t Path: Confronting Similarity with Dissimilarity

Addressing a quest by Gupta et al. [ICALP'14], we provide a first, compr...
research
07/23/2018

On Minimum Connecting Transition Sets in Graphs

A forbidden transition graph is a graph defined together with a set of p...
research
10/02/2018

Sharp bounds for the chromatic number of random Kneser graphs

Given positive integers n> 2k, a Kneser graph KG_n,k is a graph whose ve...
research
10/17/2021

Spy game: FPT-algorithm, hardness and graph products

In the (s,d)-spy game over a graph G, k guards and one spy occupy some v...
research
12/12/2022

Degreewidth: a New Parameter for Solving Problems on Tournaments

In the paper, we define a new parameter for tournaments called degreewid...
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 ...

Please sign up or login with your details

Forgot password? Click here to reset