Nov 9, 2023 · 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 ...
Sep 2, 2018 · Pivot-minors play an important role in the study of rank-width. However, so far, pivot-minors have only been studied from a structural ...
Nov 8, 2023 · Pivot-minors play an important role in the study of rank-width. Pivot-minors have mainly been studied from a structural perspective. In this ...
Missing: Small | Show results with:Small
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 ...
Jul 12, 2018 · 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.
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 ...
Computing Small Pivot-Minors · Konrad K. Dabrowski · François Dross · Jisu Jeong · Mamadou Moustapha Kanté · O-joung Kwon · Sang-il Oum · Daniël Paulusma ...
Computing whether a graph H appears as a “pattern” inside some other graph G is a well-studied problem in the area of structural and algorithmic graph theory.
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 ...
This paper proves that the Pivot-Minor problem, which asks if a givengraph $G$ contains a pivot-minor isomorphic to a given graph $H$, is NP-complete, ...