A complexidade do reconhecimento de grafos k-fino próprio de precedência

Abstract

The class of precedence proper k-thin graphs is a subclass of proper k-thin graphs. The complexity status of recognizing proper k-thin graphs is unknown for any fixed k ≥ 2. In this work, we prove that, when k is part of the input, the problem of recognizing precedence proper k-thin graphs is NP-complete, and we present a characterization for them based on threshold graphs.