Infinitely many minimal classes of graphs of unbounded clique-width

A. Collins, J. Foniok, N. Korpelainen +2

The celebrated theorem of Robertson and Seymour states that in the family of minor-closed graph classes, there is a unique minimal class of graphs of unbounded tree-width, namely,…