Definable decompositions for graphs of bounded linear cliquewidth

03/15/2018

∙

by   Mikołaj Bojańczyk, et al.

∙

0

∙

share

We prove that for every positive integer k, there exists an MSO_1-transduction that given a graph of linear cliquewidth at most k outputs, nondeterministically, some clique decomposition of the graph of width bounded by a function of k. A direct corollary of this result is the equivalence of the notions of CMSO_1-definability and recognizability on graphs of bounded linear cliquewidth.