On the Complexity of Reconstructing H-free Graphs from Their Star Systems (Q5458528): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-78773-0_17
+Normal rank
@@ Property / OpenAlex ID @@
+W1565016281
@@ Property / OpenAlex ID: W1565016281 / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstructing a Graph from its Neighborhood Lists
+Normal rank
@@ Property / cites work @@
+Realizability and uniqueness in graphs
@@ Property / cites work: Realizability and uniqueness in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Isomorphism Testing and Symmetry of Graphs
@@ Property / cites work: Isomorphism Testing and Symmetry of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Towards a dichotomy theorem for the counting constraint satisfaction problem
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Neighborhood hypergraphs of bipartite graphs
@@ Property / cites work: Neighborhood hypergraphs of bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3287781
@@ Property / cites work: Q3287781 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828516
@@ Property / cites work: Q4828516 / rank @@
+Normal rank
@@ Property / cites work @@
+Le problème d'étoiles pour graphes est NP-complèt
+Normal rank
@@ Property / cites work @@
+Some NP-Complete Problems Similar to Graph Isomorphism
+Normal rank
@@ Property / DBLP publication ID @@
+conf/latin/FominKLMT08
@@ Property / DBLP publication ID: conf/latin/FominKLMT08 / rank @@
+Normal rank