Computing small pivot-minors

Abstract

A graph G contains a graph H as a pivot-minor if H can be obtained from G by applying a sequence of vertex deletions and edge pivots. Pivot-minors play an important role in the study of rank-width. However, so far, pivot-minors have only been studied from a structural perspective. We initiate a systematic study into their complexity aspects. We first prove that the Pivot-Minor problem, which asks if a given graph G contains a given graph H as a pivot-minor, is NP-complete. If H is not part of the input, we denote the problem by H-Pivot-Minor. We give a certifying polynomial-time algorithm for H -Pivot-Minor for every graph H with | V(H) | ≤ 4 except when H∈ {K4, C3+ P1, 4 P1}, via a structural characterization of H-pivot-minor-free graphs in terms of a set FH of minimal forbidden induced subgraphs.