Oct 25, 2018 · In this paper, we keep the restriction on the size of S by letting S consist of either a single vertex deletion or, for the first time, a single ...

Jun 27, 2017 · Abstract:We study the following problem: for given integers d, k and graph G, can we reduce some fixed graph parameter \pi of G by at least ...

This work proves co-NP-hardness results under some assumptions on the graphs in ${\cal H}$, which implies that Contraction ($\pi$) is co- NP-hard even for ...

We study the following problem: for given integers d,k and graph G,can we reduce some fixed graph parameter π of Gby at least d via at most k graph ...

Thumbnails Document Outline. Find: Previous. Next. Highlight all. Match case. Full Screen Mode Print Download. Go to First Page Go to Last Page.

As parameters we take the chromatic number χ, clique number ω and independence number α, and as operations we choose edge contraction ec and vertex deletion vd.

We study the following problem: for given integers d k and graph G can we reduce some fixed graph parameter pi of G by at least d via at most k graph ...

As parameters we take the chromatic number χ, clique number ω and independence number α, and as operations we choose edge contraction ec and vertex deletion vd.

Contraction and deletion blockers for perfect graphs and H-free graphs · List of references · Publications that cite this publication.

We study the following problem: for given integers $d$, $k$ and graph $G$, can we reduce some fixed graph parameter $\pi$ of $G$ by at least $d$ via at most ...