\((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\)
From MaRDI portal
Publication:950116
DOI10.1016/j.crma.2008.07.024zbMath1170.05030OpenAlexW1528651632MaRDI QIDQ950116
Nadia El Amri, Abdelhak Chaïchaâ, Youssef Boudabbous, Abderrahim Boussaïri
Publication date: 22 October 2008
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.2008.07.024
Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- The \(C_{3}\)-structure of the tournaments.
- The minimal non-\((\leqslant k)\)-reconstructible relations
- La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
- L'Indeformabilite des Relations et Multirelations Binaires
- La relation différence et l'anti‐isomorphie
- Transitiv orientierbare Graphen
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: \((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\)