Stable graphs
From MaRDI portal
Cited in
(25)- Some universal graphs
- Universal elements and the complexity of certain classes of infinite graphs
- Interpretation of graphs in the lattices of dimension three
- Regular partitions of gentle graphs
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
- VC-density for trees
- Strict superstablity and decidability of certain generic graphs
- Interpreting nowhere dense graph classes as a classical notion of model theory
- Bounds on half graph orders in powers of sparse graphs
- Vapnik-Chervonenkis density in some theories without the independence property. I
- On ultralimits of sparse graph classes
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness
- Infinite stable graphs with large chromatic number
- Progressive algorithms for domination and independence
- Infinite stable graphs with large chromatic number. II
- Model checking on interpretations of classes of bounded local cliquewidth
- A note on pseudofinite acyclic graphs
- Indiscernibles in monadically NIP theories
- On first-order transductions of classes of graphs
- Twin-width. VIII: Delineation and win-wins
- Planar graphs with separation are dp-minimal
- Monadic NIP in monotone classes of relational structures (extended abstract)
- First-order transductions of graphs (invited talk)
- On the VC dimension of first-order logic with counting and weight aggregation
- Twin-width. VIIIa: Delineation
This page was built for publication: Stable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4193515)
