Computing roots of graphs is hard (Q1336641): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+Characterization of n-path graphs and of graphs having \(n\)-th root
+Normal rank
@@ Property / cites work @@
+The square of every two-connected graph is Hamiltonian
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The square root of a digraph
@@ Property / cites work: The square root of a digraph / rank @@
+Normal rank
@@ Property / cites work @@
+A criterion for planarity of the square of a graph
+Normal rank
@@ Property / cites work @@
+Finding EPS-graphs
@@ Property / cites work: Finding EPS-graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Square Roots of Graphs
@@ Property / cites work: Algorithms for Square Roots of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Locality in Distributed Graph Algorithms
@@ Property / cites work: Locality in Distributed Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The square root of a graph
@@ Property / cites work: The square root of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5728984
@@ Property / cites work: Q5728984 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1336641