Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments
From MaRDI portal
Publication:2271991
DOI10.1016/j.crma.2009.06.002zbMath1179.05049OpenAlexW2060800909MaRDI QIDQ2271991
Publication date: 5 August 2009
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.2009.06.002
Related Items (3)
The \((\leq 6)\)-half-reconstructibility of digraphs ⋮ The pairs of \(\{-3\}\)-hypomorphic tournaments ⋮ Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
Cites Work
- 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.
- Graph reconstruction—a survey
- RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
- RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) II
- Transitiv orientierbare Graphen
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments