MSO undecidability for hereditary classes of unbounded clique-width
From MaRDI portal
Publication:6614399
DOI10.1016/J.EJC.2023.103700zbMATH Open1548.05277MaRDI QIDQ6614399
Publication date: 7 October 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Structural characterization of families of graphs (05C75) Decidability of theories and sets of sentences (03B25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Higher-order logic (03B16)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sparsity. Graphs, structures, and algorithms
- A new graph construction of unbounded clique-width
- Minimal classes of graphs of unbounded clique-width
- Graph minors. XX: Wagner's conjecture
- The structure of the models of decidable monadic theories of graphs
- Trees, grids, and MSO decidability: from graphs to matroids
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- Upper bounds to the clique width of graphs
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width
- Handle-rewriting hypergraph grammars
- From tree-decompositions to clique-width terms
- Infinitely many minimal classes of graphs of unbounded clique-width
- The monadic second-order logic of graphs. XV: On a conjecture by D. Seese
- Approximating clique-width and branch-width
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
- Well-quasi-ordering Does Not Imply Bounded Clique-width
- On the Parameterised Intractability of Monadic Second-Order Logic
- On the Relationship Between Clique-Width and Treewidth
This page was built for publication: MSO undecidability for hereditary classes of unbounded clique-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614399)
