Are all pairs of hypomorphic digraphs \(S\)-isomorphic? (Q2161275): Difference between revisions

@@ Property / cites work @@
+On nonreconstructable tournaments
@@ Property / cites work: On nonreconstructable tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Q2829077
@@ Property / cites work: Q2829077 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph reconstruction—a survey
@@ Property / cites work: Graph reconstruction—a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q3816105
@@ Property / cites work: Q3816105 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+On the problem of reconstructing a tournament from subtournaments
+Normal rank
@@ Property / cites work @@
+Hypomorphisms, orbits, and reconstruction
@@ Property / cites work: Hypomorphisms, orbits, and reconstruction / rank @@
+Normal rank
@@ Property / cites work @@
+N-reconstructibility of non-reconstructible digraphs
+Normal rank
@@ Property / cites work @@
+Q4085743
@@ Property / cites work: Q4085743 / rank @@
+Normal rank
@@ Property / cites work @@
+Erratum to: “The falsity of the reconstruction conjecture for tournaments”
+Normal rank
@@ Property / cites work @@
+A census of non-reconstructable digraphs. I: Six related families
+Normal rank
@@ Property / cites work @@
+Q3824450
@@ Property / cites work: Q3824450 / rank @@
+Normal rank