Pages that link to "Item:Q2562867"
From MaRDI portal
The following pages link to Some remarks on simple tournaments (Q2562867):
Displaying 40 items.
- Algorithmic and structural aspects of the \(P_3\)-Radon number (Q363552) (← links)
- On the Carathéodory number of interval and graph convexities (Q392186) (← links)
- Subtournaments isomorphic to \(W_5\) in a indecomposable tournament (Q424734) (← links)
- An upper bound on the \(P_3\)-Radon number (Q442343) (← links)
- Graphs with few \(P_4\)'s under the convexity of paths of order three (Q491593) (← links)
- Inapproximability results for graph convexity parameters (Q496002) (← links)
- Radon numbers for trees (Q729762) (← links)
- A remark on the tournament game (Q888601) (← links)
- The morphology of infinite tournaments; application to the growth of their profile (Q966158) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- On the functional completeness of simple tournaments (Q1047117) (← links)
- Homogeneous tournaments revisited (Q1116952) (← links)
- Simple tournaments and sharply transitive groups (Q1201246) (← links)
- Either tournaments or algebras? (Q1215638) (← links)
- On the \(P_3\)-hull number of some products of graphs (Q1634756) (← links)
- The maximum time of 2-neighbor bootstrap percolation: complexity results (Q1686067) (← links)
- The convexity of induced paths of order three and applications: complexity aspects (Q1701089) (← links)
- Characterization and recognition of Radon-independent sets in split graphs (Q1941699) (← links)
- Making a tournament indecomposable by one subtournament-reversal operation (Q2045379) (← links)
- On the \(P_3\)-hull number of Hamming graphs (Q2185729) (← links)
- Prime orientable graphs (Q2237224) (← links)
- Partitioning a graph into convex sets (Q2275456) (← links)
- The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects (Q2346581) (← links)
- Decomposability index of tournaments (Q2404390) (← links)
- Inapproximability results and bounds for the Helly and Radon numbers of a graph (Q2410232) (← links)
- On two-path convexity in multipartite tournaments (Q2426441) (← links)
- On the contour of graphs (Q2446313) (← links)
- The Carathéodory number of the \(P_3\) convexity of chordal graphs (Q2449132) (← links)
- Embedding tournaments in simple tournaments (Q2552138) (← links)
- Decomposability and co-modular indices of tournaments (Q2659184) (← links)
- On the convexity of paths of length two in undirected graphs (Q2839205) (← links)
- On the Carathéodory number for the convexity of paths of order three (Q2857327) (← links)
- The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results (Q2945205) (← links)
- SIMPLE EXTENSIONS OF COMBINATORIAL STRUCTURES (Q3087001) (← links)
- The simplicity index of tournaments (Q5061406) (← links)
- Simple one‐point extensions of tournaments (Q5652702) (← links)
- Hull and geodetic numbers for some classes of oriented graphs (Q5918550) (← links)
- Hull and geodetic numbers for some classes of oriented graphs (Q5918666) (← links)
- Target set selection with maximum activation time (Q6110610) (← links)
- Irreducible pairings and indecomposable tournaments (Q6580491) (← links)
