On a new digraph reconstruction conjecture (Q1159216): Difference between revisions

@@ Property / cites work @@
+On nonreconstructable tournaments
@@ Property / cites work: On nonreconstructable tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+On Ulam's conjecture for separable graphs
@@ Property / cites work: On Ulam's conjecture for separable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5544087
@@ Property / cites work: Q5544087 / rank @@
+Normal rank
@@ Property / cites work @@
+Determining connectedness from subdigraphs
@@ Property / cites work: Determining connectedness from subdigraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4085743
@@ Property / cites work: Q4085743 / rank @@
+Normal rank
@@ Property / cites work @@
+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 / full work available at URL @@
+https://doi.org/10.1016/s0095-8956(81)80019-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2955171540
@@ Property / OpenAlex ID: W2955171540 / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/jctb/Ramachandran81
@@ Property / DBLP publication ID: journals/jctb/Ramachandran81 / rank @@
+Normal rank