Finite tournaments with a nonempty diamonds' support
From MaRDI portal
Publication:2637718
DOI10.1007/S00373-012-1233-4zbMath1285.05076OpenAlexW2000124542MaRDI QIDQ2637718
Houcine Bouchaala, Mohamed Baka Elayech, Youssef Boudabbous
Publication date: 14 February 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1233-4
Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primitivity is hereditary for 2-structures
- The morphology of infinite tournaments; application to the growth of their profile
- Indecomposable graphs
- Sur la répartition des diamants dans un tournoi. (On the repartition of diamonds in a tournament).
- Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Probabilities on finite models
- RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
- LA RECONSTRUCTION DES TOURNOIS SANS DIAMANT
- Transitiv orientierbare Graphen
This page was built for publication: Finite tournaments with a nonempty diamonds' support