Pages that link to "Item:Q2366019"
From MaRDI portal
The following pages link to Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures (Q2366019):
Displaying 50 items.
- Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) (Q343743) (← links)
- The indecomposable tournaments T with \(|W_5(T)|=|T|-2\) (Q373659) (← links)
- 3-minimal triangle-free graphs (Q397131) (← links)
- Subtournaments isomorphic to \(W_5\) in a indecomposable tournament (Q424734) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Critically twin primitive 2-structures (Q497313) (← links)
- Criticality of switching classes of reversible 2-structures labeled by an abelian group (Q503678) (← links)
- An algorithm computing combinatorial specifications of permutation classes (Q526814) (← links)
- Prime orders all of whose prime suborders are selfdual (Q603888) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- The half-isomorphy and the finite strongly connected tournaments (Q698691) (← links)
- Indecomposable tournaments and their indecomposable subtournaments on 5 vertices (Q858914) (← links)
- The morphology of infinite tournaments; application to the growth of their profile (Q966158) (← links)
- Inversions in tournaments (Q990189) (← links)
- Critical support of an indecomposable graph (Q1000641) (← links)
- Critically indecomposable graphs (Q1003768) (← links)
- Graphs critically without duo (Q1018107) (← links)
- The recognition of the class of indecomposable digraphs under low hemimorphy (Q1025969) (← links)
- Indecomposability graph and critical vertices of an indecomposable graph (Q1043637) (← links)
- A \(k\)-structure generalization of the theory of 2-structures (Q1334662) (← links)
- Indecomposable graphs (Q1367028) (← links)
- Minimal indecomposable graphs (Q1382817) (← links)
- The \(\{-2,-1\}\)-selfdual and decomposable tournaments (Q1649912) (← links)
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (Q1730221) (← links)
- What is reconstruction for ordered sets? (Q1772277) (← links)
- Critical and infinite tournaments (Q1871488) (← links)
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures (Q1897475) (← links)
- The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations (Q2014353) (← links)
- Making a tournament indecomposable by one subtournament-reversal operation (Q2045379) (← links)
- Editing to prime graphs (Q2049029) (← links)
- Prime 3-uniform hypergraphs (Q2053735) (← links)
- Critical 3-hypergraphs (Q2108059) (← links)
- Tournaments with maximal decomposability (Q2144570) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Prime orientable graphs (Q2237224) (← links)
- Ultracritical and hypercritical binary structures (Q2275373) (← links)
- Forbidden substructures and combinatorial dichotomies: WQO and universality (Q2275384) (← links)
- Inflations of geometric grid classes of permutations (Q2339726) (← links)
- Decomposing inversion sets of permutations and applications to faces of the Littlewood-Richardson cone (Q2358803) (← links)
- Critical and infinite directed graphs (Q2384422) (← links)
- Decomposability index of tournaments (Q2404390) (← links)
- Simple permutations and algebraic generating functions (Q2426423) (← links)
- On an adjacency property of almost all tournaments (Q2433700) (← links)
- Indecomposability graph and indecomposability recognition (Q2434744) (← links)
- Recognition of prime graphs from a prime subgraph (Q2449165) (← links)
- Morphology of the \((-1)\)-critical tournaments (Q2465787) (← links)
- Simple permutations: Decidability and unavoidable substructures (Q2474234) (← links)
- Partially critical tournaments (Q2476521) (← links)
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975) (← links)
- Indecomposable tournaments and their indecomposable subtournaments with six vertices (Q2517075) (← links)
