Tournaments without acyclic interval.
From MaRDI portal
Publication:2573972
DOI10.1016/j.crma.2005.09.017zbMath1076.05039MaRDI QIDQ2573972
Jean-François Culus, Bertrand Jouve
Publication date: 25 November 2005
Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.crma.2005.09.017
05C20: Directed graphs (digraphs), tournaments
Related Items
The morphology of infinite tournaments; application to the growth of their profile, Graphs critically without duo
Cites Work
- Vertex critical r-dichromatic tournaments
- Tournament solutions and majority voting
- Indecomposable graphs
- Indecomposability and duality of tournaments
- Linear-time modular decomposition of directed graphs
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Transitive convex subsets in large tournaments