The following pages link to Indecomposable graphs (Q1367028):
Displaying 37 items.
- The indecomposable tournaments T with \(|W_5(T)|=|T|-2\) (Q373659) (← links)
- Subtournaments isomorphic to \(W_5\) in a indecomposable tournament (Q424734) (← links)
- Criticality of switching classes of reversible 2-structures labeled by an abelian group (Q503678) (← links)
- Indecomposable tournaments and their indecomposable subtournaments on 5 vertices (Q858914) (← 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)
- Minimal indecomposable graphs (Q1382817) (← links)
- The \(C_{3}\)-structure of the tournaments. (Q1426106) (← links)
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (Q1730221) (← links)
- What is reconstruction for ordered sets? (Q1772277) (← links)
- Making a tournament indecomposable by one subtournament-reversal operation (Q2045379) (← 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)
- Decomposing simple permutations, with enumerative consequences (Q2377669) (← links)
- Critical and infinite directed graphs (Q2384422) (← links)
- Decomposability index of tournaments (Q2404390) (← 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)
- 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)
- Convex circuit-free coloration of an oriented graph (Q2519795) (← links)
- Tournaments without acyclic interval. (Q2573972) (← links)
- Finite tournaments with a nonempty diamonds' support (Q2637718) (← links)
- Decomposability and co-modular indices of tournaments (Q2659184) (← links)
- SIMPLE EXTENSIONS OF COMBINATORIAL STRUCTURES (Q3087001) (← links)
- Some Algorithms on Conditionally Critical Indecomposable Graphs (Q3439358) (← links)
- Aggregation of Markov flows I: theory (Q5154199) (← links)
- Primality, criticality and minimality problems in trees (Q6132864) (← links)
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (Q6180640) (← links)
- The primality graph of critical 3-hypergraphs (Q6489359) (← links)
- Well-quasi-ordering and Embeddability of Relational Structures (Q6493759) (← links)
