The size of a graph is reconstructible from any \(n-2\) cards (Q2411612): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2017.08.026
+Normal rank
@@ Property / OpenAlex ID @@
+W2755285488
@@ Property / OpenAlex ID: W2755285488 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Families of pairs of graphs with a large number of common cards
+Normal rank
@@ Property / cites work @@
+Recognizing connectedness from vertex-deleted subgraphs
+Normal rank
@@ Property / cites work @@
+A new approach to graph reconstruction using supercards
+Normal rank
@@ Property / cites work @@
+A congruence theorem for trees
@@ Property / cites work: A congruence theorem for trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q2895327
@@ Property / cites work: Q2895327 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4414312
@@ Property / cites work: Q4414312 / rank @@
+Normal rank
@@ Property / cites work @@
+The degree sequence is reconstructible from \(n-1\) cards
+Normal rank
@@ Property / cites work @@
+Q2828914
@@ Property / cites work: Q2828914 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2936665
@@ Property / cites work: Q2936665 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3059003
@@ Property / cites work: Q3059003 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3259049
@@ Property / cites work: Q3259049 / rank @@
+Normal rank
@@ Property / cites work @@
+Towards size reconstruction from fewer cards
@@ Property / cites work: Towards size reconstruction from fewer cards / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2411612