有界线性团宽图的可定义分解
Definable decompositions for graphs of bounded linear cliquewidth
AI总结:
本文证明存在MSO_1转导,可从线性团宽至多k的图非确定性地输出宽度有界的团宽分解,进而得出CMSO_1可定义性与可识别性在有界线性团宽图上的等价性。
摘要:
我们证明,对于每个正整数k,存在一个MSO_1转导,给定一个线性团宽至多为k的图,非确定性地输出该图的一个团宽分解,其宽度由k的函数界定。这一结果的直接推论是,在有界线性团宽的图上,CMSO_1可定义性与可识别性这两个概念等价。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。