Arborescent Structures. II: Interpretability in the Theory of Trees
From MaRDI portal
Publication:3931369
Cited in
(6)- The structure of the models of decidable monadic theories of graphs
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Back-and-forth for systems of antichains
- Vaught's conjecture for almost chainable theories
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures
- Sharp Vaught's conjecture for some classes of partial orders
This page was built for publication: Arborescent Structures. II: Interpretability in the Theory of Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3931369)