The pairs of \(\{-3\}\)-hypomorphic tournaments
From MaRDI portal
Publication:432667
DOI10.1016/j.crma.2012.04.022zbMath1244.05099MaRDI QIDQ432667
Mouna Achour, Youssef Boudabbous, Abderrahim Boussaïri
Publication date: 4 July 2012
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.2012.04.022
05C20: Directed graphs (digraphs), tournaments
03E20: Other classical set theory (including functions, relations, and set algebra)
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The half-isomorphy and the finite strongly connected tournaments
- Rélations non reconstructibles par leurs restrictions
- Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
- Strongly self-complementary and hereditarily isomorphic tournaments
- The \(C_{3}\)-structure of the tournaments.
- Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments
- HEREDITARY HEMIMORPHY OF {-κ}-HEMIMORPHIC TOURNAMENTS FOR ≥ 5
- The falsity of the reconstruction conjecture for tournaments
- Graph reconstruction—a survey
- L'Indeformabilite des Relations et Multirelations Binaires
- RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) II
- Transitiv orientierbare Graphen