In this work, we initiate the complexity study of Biclique Contraction a...
For a positive integer ℓ≥ 3, the C_ℓ-Contractibility problem
takes as in...
A class domination coloring (also called cd-Coloring or dominated colori...
We show that for each non-negative integer k, every bipartite tournament...
Given a directed graph D on n vertices and a positive integer k, the
Arc...
The CONNECTED VERTEX COVER problem asks for a vertex cover in a graph th...