Definable decompositions for graphs of bounded linear cliquewidth
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 th...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V.
2021-01-01
|
| Series: | Logical Methods in Computer Science |
| Subjects: | |
| Online Access: | https://lmcs.episciences.org/5295/pdf |
| _version_ | 1797268540051423232 |
|---|---|
| author | Mikołaj Bojańczyk Martin Grohe Michał Pilipczuk |
| author_facet | Mikołaj Bojańczyk Martin Grohe Michał Pilipczuk |
| author_sort | Mikołaj Bojańczyk |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-25T01:34:06Z |
| format | Article |
| id | doaj.art-0ab6211c22fe49b88a31d86a5860d9e1 |
| institution | Directory Open Access Journal |
| issn | 1860-5974 |
| language | English |
| last_indexed | 2024-04-25T01:34:06Z |
| publishDate | 2021-01-01 |
| publisher | Logical Methods in Computer Science e.V. |
| record_format | Article |
| series | Logical Methods in Computer Science |
| spelling | doaj.art-0ab6211c22fe49b88a31d86a5860d9e12024-03-08T10:33:15ZengLogical Methods in Computer Science e.V.Logical Methods in Computer Science1860-59742021-01-01Volume 17, Issue 110.23638/LMCS-17(1:5)20215295Definable decompositions for graphs of bounded linear cliquewidthMikołaj BojańczykMartin GroheMichał Pilipczukhttps://orcid.org/0000-0001-7891-1988We 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.https://lmcs.episciences.org/5295/pdfcomputer science - logic in computer science |
| spellingShingle | Mikołaj Bojańczyk Martin Grohe Michał Pilipczuk Definable decompositions for graphs of bounded linear cliquewidth Logical Methods in Computer Science computer science - logic in computer science |
| title | Definable decompositions for graphs of bounded linear cliquewidth |
| title_full | Definable decompositions for graphs of bounded linear cliquewidth |
| title_fullStr | Definable decompositions for graphs of bounded linear cliquewidth |
| title_full_unstemmed | Definable decompositions for graphs of bounded linear cliquewidth |
| title_short | Definable decompositions for graphs of bounded linear cliquewidth |
| title_sort | definable decompositions for graphs of bounded linear cliquewidth |
| topic | computer science - logic in computer science |
| url | https://lmcs.episciences.org/5295/pdf |
| work_keys_str_mv | AT mikołajbojanczyk definabledecompositionsforgraphsofboundedlinearcliquewidth AT martingrohe definabledecompositionsforgraphsofboundedlinearcliquewidth AT michałpilipczuk definabledecompositionsforgraphsofboundedlinearcliquewidth |