Primitivity is hereditary for 2-structures

From MaRDI portal
Revision as of 17:06, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 (63)

Primitive 2-structures with the \((n-2)\)-propertyA \(k\)-structure generalization of the theory of 2-structuresTournaments with maximal decomposabilityFinite tournaments with a nonempty diamonds' supportCritical and infinite directed graphsIndecomposable tournaments and their indecomposable subtournaments on 5 verticesUnnamed ItemIndecomposable graphsDecomposability and co-modular indices of tournamentsDecomposability index of tournamentsFrom modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-catsMinimal indecomposable graphsStructure Theorem forU5-free Tournaments3-minimal triangle-free graphsUnnamed ItemPrimality, criticality and minimality problems in treesResolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphsDecomposition of infinite labeled 2-structuresSubtournaments isomorphic to \(W_5\) in a indecomposable tournamentIndecomposability graph and indecomposability recognitionTheory of 2-structures. II: Representation through labeled tree familiesParameterized complexity of the weighted independent set problem beyond graphs of bounded clique numberA survey of the algorithmic aspects of modular decompositionThe \(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 tournamentsA tight lower bound for primitivity in k-structuresParameterized Algorithms for the Independent Set Problem in Some Hereditary Graph ClassesAngular 2-structuresCharacterization and complexity of uniformly nonprimitive labeled 2-structuresMorphology of the \((-1)\)-critical tournamentsCriticality of switching classes of reversible 2-structures labeled by an abelian groupTheory of 2-structuresFinite orders which are reconstructible up to duality by their comparability graphsT-structures, T-functions, and textsA polynomial algorithm to find an independent set of maximum weight in a fork-free graphPartially critical tournamentsCut-primitive directed graphs versus clan-primitive directed graphsThe modular decomposition of countable graphs. Definition and construction in monadic second-order logicThe half-isomorphy and the finite strongly connected tournamentsNesting of prime substructures in \(k-\)ary relationsThe mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relationsFully dynamic recognition algorithm and certificate for directed cographsUltracritical and hypercritical binary structuresReconstructing gene trees from Fitch's xenology relationCritical support of an indecomposable graphTriangle-free graphs which are minimal for some nonstable 4-vertex subsetCritically indecomposable graphsIndecomposable tournaments and their indecomposable subtournaments with six verticesConvex circuit-free coloration of an oriented graphMaking a tournament indecomposable by one subtournament-reversal operationEditing to prime graphsSkew-symmetric matrices and their principal minorsPrime 3-uniform hypergraphsThe recognition of the class of indecomposable digraphs under low hemimorphyFrom modular decomposition trees to rooted median graphsUnnamed ItemIndecomposability graph and critical vertices of an indecomposable graphMiscellaneous Digraph ClassesModular decomposition and transitive orientationTwo {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphicGeneralized tournament matrices with the same principal minorsCritical and infinite tournaments




Cites Work




This page was built for publication: Primitivity is hereditary for 2-structures