The following pages link to Minimal indecomposable graphs (Q1382817):
Displaying 17 items.
- 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)
- The recognition of the class of indecomposable digraphs under low hemimorphy (Q1025969) (← links)
- Indecomposability graph and critical vertices of an indecomposable graph (Q1043637) (← links)
- The \(C_{3}\)-structure of the tournaments. (Q1426106) (← links)
- The \((\leq 5)\)-hypomorphy of digraphs up to complementation (Q1713868) (← links)
- Letter graphs and modular decomposition (Q2065788) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Indecomposability graph and indecomposability recognition (Q2434744) (← links)
- Recognition of prime graphs from a prime subgraph (Q2449165) (← links)
- Triangle-free graphs which are minimal for some nonstable 4-vertex subset (Q2515449) (← links)
- Birecognition of prime graphs, and minimal prime graphs (Q6115742) (← 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)
