Uncountably many minimal hereditary classes of graphs of unbounded clique-width

Robert Brignall, Daniel Cocks

Given an infinite word over the alphabet $\{0,1,2,3\}$, we define a class of bipartite hereditary graphs ${\mathcal{G}}^{\alpha }$, and show that ${\mathcal{G}}^{\alpha }$ has unbounded clique-width u…