On the complexity of reconstructing H-free graphs from their Star Systems (Q3174240): 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.1002/jgt.20544
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.20544 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2017704251
@@ Property / OpenAlex ID: W2017704251 / 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 @@
+Neighborhood hypergraphs of bipartite graphs
@@ Property / cites work: Neighborhood hypergraphs of bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Reconstructing H-free Graphs from Their Star Systems
+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