Theory of 2-structures. I: Clans, basic subclasses, and morphisms
From MaRDI portal
Recommendations
Cites work
Cited in
(52)- Drawing graphs with attribute graph grammars
- Primitivity is hereditary for 2-structures
- Explicating logical independence
- scientific article; zbMATH DE number 1478125 (Why is no real title available?)
- Critically twin primitive 2-structures
- Critically indecomposable graphs
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs
- Decomposition of infinite labeled 2-structures
- Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
- Primitive bound of a 2-structure
- Clans and regions in 2-structures
- A \(k\)-structure generalization of the theory of 2-structures
- A tight lower bound for primitivity in k-structures
- Group based graph transformations and hierarchical representations of graphs
- Context-free text grammars
- Linear-time modular decomposition of directed graphs
- Theory of 2-structures
- Algorithmic aspects of switch cographs
- Dynamic labeled 2-structures with variable domains
- Decomposition tree of a lexicographic product of binary structures
- Characterization and complexity of uniformly nonprimitive labeled 2-structures
- Best match graphs and reconciliation of gene trees with species trees
- Dynamic labeled 2-structures
- Generalized tournament matrices with the same principal minors
- Monadic second-order definable text languages
- T-structures, T-functions, and texts
- PC trees and circular-ones arrangements.
- Finite metrics in switching classes
- Existential MSO over two successors is strictly weaker than over linear orders
- A characterization of set representable labeled partial 2-structures through decompositions
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats
- From modular decomposition trees to rooted median graphs
- Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees
- Definable transductions and weighted logics for texts
- Primitive 2-structures with the \((n-2)\)-property
- Incremental construction of 2-structures
- MSO definable text languages
- NLC\(_{2}\)-decomposition in polynomial time
- Criticality of switching classes of reversible 2-structures labeled by an abelian group
- Complete edge-colored permutation graphs
- Modular decomposition and transitive orientation
- Generalized Fitch graphs: edge-labeled graphs that are explained by edge-labeled trees
- Angular 2-structures
- The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations
- Partial (set) 2-structures. I: Basic notions and the representation problems
- Partial (set) 2-structures. II: State spaces of concurrent systems
- Theory of 2-structures. II: Representation through labeled tree families
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures
- Modules in Robinson Spaces
- scientific article; zbMATH DE number 591000 (Why is no real title available?)
- Linear time algorithms for NP-hard problems restricted to \textsc{GaTEx} graphs
- Prime 2-structures
This page was built for publication: Theory of 2-structures. I: Clans, basic subclasses, and morphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q913822)
