Linear Clique-Width of Bi-complement Reducible Graphs

摘要

We prove that in the class of bi-complement reducible graphs linear clique-width is unbounded and show that this class contains exactly two minimal hereditary subclasses of unbounded linear clique-width.