The following pages link to (Q3691676):
Displayed 22 items.
- The indecomposable tournaments T with \(|W_5(T)|=|T|-2\) (Q373659) (← links)
- \(\{-1\}\)-self dual finite prechains and applications (Q392596) (← links)
- 3-minimal triangle-free graphs (Q397131) (← links)
- Pairs of orthogonal countable ordinals (Q400437) (← links)
- Subtournaments isomorphic to \(W_5\) in a indecomposable tournament (Q424734) (← links)
- Indecomposable tournaments and their indecomposable subtournaments on 5 vertices (Q858914) (← links)
- Critically indecomposable graphs (Q1003768) (← links)
- Indecomposable graphs (Q1367028) (← links)
- Minimal indecomposable graphs (Q1382817) (← links)
- Sur la répartition des diamants dans un tournoi. (On the repartition of diamonds in a tournament). (Q1426559) (← links)
- Half-reconstruction of the operator transitive closure (Q1598447) (← links)
- Finite orders which are reconstructible up to duality by their comparability graphs (Q1988547) (← links)
- A type of algebraic structure related to sets of intervals (Q2088070) (← links)
- Orthogonal countable linear orders (Q2314417) (← links)
- Computing possible and certain answers over order-incomplete data (Q2334598) (← links)
- Critically prime orders (Q2427215) (← links)
- Morphology of the \((-1)\)-critical tournaments (Q2465787) (← links)
- Triangle-free graphs which are minimal for some nonstable 4-vertex subset (Q2515449) (← links)
- Indecomposable tournaments and their indecomposable subtournaments with six vertices (Q2517075) (← links)
- Finite tournaments with a nonempty diamonds' support (Q2637718) (← links)
- (Q5144372) (← links)
- Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic (Q5863935) (← links)