Inversions in tournaments
From MaRDI portal
Publication:990189
DOI10.1016/j.crma.2010.06.022zbMath1209.05105arXiv1007.2103OpenAlexW2062725515MaRDI QIDQ990189
Maurice Pouzet, Houmem Belkhechine, Moncef Bouaziz, Imed Boudabbous
Publication date: 6 September 2010
Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.2103
Related Items (3)
Decomposability index of tournaments ⋮ Invertibility of Digraphs and Tournaments ⋮ Making a tournament indecomposable by one subtournament-reversal operation
Cites Work
- Unnamed Item
- Unnamed Item
- The morphology of infinite tournaments; application to the growth of their profile
- Theory of relations. Transl. from the French by P. Clote
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Morphology of the \((-1)\)-critical tournaments
- Convex circuit-free coloration of an oriented graph
- Structure theorem for tournaments omitting N5
- Transitiv orientierbare Graphen
This page was built for publication: Inversions in tournaments