Extension preservation on dense graph classes
From MaRDI portal
Cites work
- A counterexample to a conjecture of Scott and Suppes
- Algebraic graph theory. Morphisms, monoids and matrices
- Clique-width for hereditary graph classes
- Datalog vs first-order logic
- Deciding first-order properties of nowhere dense graphs
- Finite Model Theory on Tame Classes of Structures
- First order properties on nowhere dense structures
- First-Order Model Checking on Structurally Sparse Graph Classes
- Flip-width: cops and robber on dense graphs
- Homomorphism preservation on quasi-wide classes
- Homomorphism preservation theorems
- scientific article; zbMATH DE number 4008383 (Why is no real title available?)
- scientific article; zbMATH DE number 1324669 (Why is no real title available?)
- scientific article; zbMATH DE number 7029306 (Why is no real title available?)
- scientific article; zbMATH DE number 7788458 (Why is no real title available?)
- Indiscernibles and flatness in monadically stable and monadically NIP classes
- Induced subgraphs and well‐quasi‐ordering
- Interpreting nowhere dense graph classes as a classical notion of model theory
- On preservation under homomorphisms and unions of conjunctive queries
- Preservation under Extensions on Well-Behaved Finite Structures
- Second-order quantifiers and the complexity of theories
- Sparsity. Graphs, structures, and algorithms
- Twin-width. I: Tractable FO model checking
- Upper bounds to the clique width of graphs
This page was built for publication: Extension preservation on dense graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7261413)
