Counterexamples to the Edge Reconstruction Conjecture for infinite graphs (Q1257028): Difference between revisions

@@ Property / cites work @@
+A counterexample to the countable version of a conjecture of Ulam
+Normal rank
@@ Property / cites work @@
+A simpler counterexample to the reconstruction conjecture for denumerable graphs
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4044629
@@ Property / cites work: Q4044629 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5652692
@@ Property / cites work: Q5652692 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the line reconstruction problem
@@ Property / cites work: A note on the line reconstruction problem / rank @@
+Normal rank
@@ Property / cites work @@
+The edge reconstruction hypothesis is true for graphs with more than n log n edges
+Normal rank
@@ Property / cites work @@
+The falsity of the reconstruction conjecture for tournaments
+Normal rank