2000 character limit reached
Definable decompositions for graphs of bounded linear cliquewidth (1803.05937v5)
Published 15 Mar 2018 in cs.LO
Abstract: 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 cliquewidth 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.