Problem: cutwidth decomposition

Definition:
Input: A graph G in this class and an integer k.
Output: True iff the cutwidth of G is at most k.

Linear

Polynomial

GI-complete

NP-hard

NP-complete

coNP-complete

Open

Unknown to ISGCI