Edge-recognizable domination numbers. (Q1415542): Difference between revisions

@@ Property / cites work @@
+Q3818357
@@ Property / cites work: Q3818357 / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstructing Graphs
@@ Property / cites work: Reconstructing Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5581298
@@ Property / cites work: Q5581298 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5544087
@@ Property / cites work: Q5544087 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+A congruence theorem for trees
@@ Property / cites work: A congruence theorem for trees / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstruction of Trees
@@ Property / cites work: Reconstruction of Trees / rank @@
+Normal rank
@@ Property / cites work @@
+On reconstructing graphs from their sets of subgraphs
+Normal rank
@@ Property / cites work @@
+Bidegreed graphs are edge reconstructible
@@ Property / cites work: Bidegreed graphs are edge reconstructible / rank @@
+Normal rank
@@ Property / cites work @@
+Q3259049
@@ Property / cites work: Q3259049 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0012-365x(03)00183-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2072579127
@@ Property / OpenAlex ID: W2072579127 / rank @@
+Normal rank