Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
From MaRDI portal
Publication:2366019
DOI10.1016/0012-365X(93)90516-VzbMath0776.06002OpenAlexW2070286422MaRDI QIDQ2366019
James H. Schmerl, William T. jun. Trotter
Publication date: 29 June 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)90516-v
embeddingsgraphsfinite posetdigraphstournamentslexicographic productcritically indecomposable binary relational structurescritically indecomposable posets
Partial orders, general (06A06) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)
Related Items (75)
Decomposing inversion sets of permutations and applications to faces of the Littlewood-Richardson cone ⋮ A \(k\)-structure generalization of the theory of 2-structures ⋮ Labelled well-quasi-order for permutation classes ⋮ Tournaments with maximal decomposability ⋮ An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures ⋮ Finite tournaments with a nonempty diamonds' support ⋮ Critical and infinite directed graphs ⋮ The \(\{-2,-1\}\)-selfdual and decomposable tournaments ⋮ Indecomposable tournaments and their indecomposable subtournaments on 5 vertices ⋮ Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) ⋮ 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 ⋮ The indecomposable tournaments T with \(|W_5(T)|=|T|-2\) ⋮ Prime orders all of whose prime suborders are selfdual ⋮ Resolutions of convex geometries ⋮ Minimal indecomposable graphs ⋮ Structure Theorem forU5-free Tournaments ⋮ Set recognition of decomposable graphs and steps towards their reconstruction ⋮ 3-minimal triangle-free graphs ⋮ Unnamed Item ⋮ Primality, criticality and minimality problems in trees ⋮ Hereditary classes of ordered binary structures ⋮ Simple permutations and algebraic generating functions ⋮ Symmetric maximal Condorcet domains ⋮ Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs ⋮ Subtournaments isomorphic to \(W_5\) in a indecomposable tournament ⋮ \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs ⋮ On an adjacency property of almost all tournaments ⋮ Indecomposability graph and indecomposability recognition ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ Recognition of prime graphs from a prime subgraph ⋮ The simplicity index of tournaments ⋮ Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs ⋮ A tight lower bound for primitivity in k-structures ⋮ Critically twin primitive 2-structures ⋮ Characterization and complexity of uniformly nonprimitive labeled 2-structures ⋮ Prime orientable graphs ⋮ Morphology of the \((-1)\)-critical tournaments ⋮ Criticality of switching classes of reversible 2-structures labeled by an abelian group ⋮ Theory of 2-structures ⋮ Group based graph transformations and hierarchical representations of graphs ⋮ Simple permutations: Decidability and unavoidable substructures ⋮ Partially critical tournaments ⋮ An algorithm computing combinatorial specifications of permutation classes ⋮ Cut-primitive directed graphs versus clan-primitive directed graphs ⋮ The modular decomposition of countable graphs. Definition and construction in monadic second-order logic ⋮ The morphology of infinite tournaments; application to the growth of their profile ⋮ 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 ⋮ What is reconstruction for ordered sets? ⋮ Ultracritical and hypercritical binary structures ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ Inversions in tournaments ⋮ Critical support of an indecomposable graph ⋮ 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 ⋮ Prime 3-uniform hypergraphs ⋮ Graphs critically without duo ⋮ The recognition of the class of indecomposable digraphs under low hemimorphy ⋮ Unnamed Item ⋮ Indecomposability graph and critical vertices of an indecomposable graph ⋮ Simple permutations and pattern restricted permutations ⋮ Tournaments without acyclic interval. ⋮ Inflations of geometric grid classes of permutations ⋮ Some Algorithms on Conditionally Critical Indecomposable Graphs ⋮ Critical 3-hypergraphs ⋮ 3-uniform hypergraphs: modular decomposition and realization by tournaments ⋮ Critical and infinite tournaments
Cites Work
This page was built for publication: Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
