Primitivity is hereditary for 2-structures
From MaRDI portal
Publication:913824
DOI10.1016/0304-3975(90)90131-ZzbMath0701.05053OpenAlexW2013934077MaRDI QIDQ913824
Andrzej Ehrenfeucht, Grzegorz Rozenberg
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(90)90131-z
Related Items
Primitive 2-structures with the \((n-2)\)-property, A \(k\)-structure generalization of the theory of 2-structures, Tournaments with maximal decomposability, Finite tournaments with a nonempty diamonds' support, Critical and infinite directed graphs, Indecomposable tournaments and their indecomposable subtournaments on 5 vertices, Unnamed Item, Indecomposable graphs, Decomposability and co-modular indices of tournaments, Decomposability index of tournaments, From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats, Minimal indecomposable graphs, Structure Theorem forU5-free Tournaments, 3-minimal triangle-free graphs, Unnamed Item, Primality, criticality and minimality problems in trees, Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs, Decomposition of infinite labeled 2-structures, Subtournaments isomorphic to \(W_5\) in a indecomposable tournament, Indecomposability graph and indecomposability recognition, Theory of 2-structures. II: Representation through labeled tree families, Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number, A survey of the algorithmic aspects of modular decomposition, The \(C_{3}\)-structure of the tournaments., Sur la répartition des diamants dans un tournoi. (On the repartition of diamonds in a tournament)., The simplicity index of tournaments, A tight lower bound for primitivity in k-structures, Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes, Angular 2-structures, Characterization and complexity of uniformly nonprimitive labeled 2-structures, Morphology of the \((-1)\)-critical tournaments, Criticality of switching classes of reversible 2-structures labeled by an abelian group, Theory of 2-structures, Finite orders which are reconstructible up to duality by their comparability graphs, T-structures, T-functions, and texts, A polynomial algorithm to find an independent set of maximum weight in a fork-free graph, Partially critical tournaments, Cut-primitive directed graphs versus clan-primitive directed graphs, The modular decomposition of countable graphs. Definition and construction in monadic second-order logic, The half-isomorphy and the finite strongly connected tournaments, Nesting of prime substructures in \(k-\)ary relations, The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations, Fully dynamic recognition algorithm and certificate for directed cographs, Ultracritical and hypercritical binary structures, Reconstructing gene trees from Fitch's xenology relation, Critical support of an indecomposable graph, Triangle-free graphs which are minimal for some nonstable 4-vertex subset, Critically indecomposable graphs, Indecomposable tournaments and their indecomposable subtournaments with six vertices, Convex circuit-free coloration of an oriented graph, Making a tournament indecomposable by one subtournament-reversal operation, Editing to prime graphs, Skew-symmetric matrices and their principal minors, Prime 3-uniform hypergraphs, The recognition of the class of indecomposable digraphs under low hemimorphy, From modular decomposition trees to rooted median graphs, Unnamed Item, Indecomposability graph and critical vertices of an indecomposable graph, Miscellaneous Digraph Classes, Modular decomposition and transitive orientation, Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic, Generalized tournament matrices with the same principal minors, Critical and infinite tournaments
Cites Work
