Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
From MaRDI portal
Abstract: We present a fixed-parameter tractable algorithm for first-order model checking on interpretations of graph classes with bounded local cliquewidth. Notably, this includes interpretations of planar graphs, and more generally, of classes of bounded genus. To obtain this result we develop a new tool which works in a very general setting of dependent classes and which we believe can be an important ingredient in achieving similar results in the future.
This page was built for publication: Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6392204)
