A note on Winkler's algorithm for factoring a connected graph (Q686292): Difference between revisions

@@ Property / cites work @@
+Computing equivalence classes among the edges of a graph with applications
+Normal rank
@@ Property / cites work @@
+Distance-preserving subgraphs of hypercubes
@@ Property / cites work: Distance-preserving subgraphs of hypercubes / rank @@
+Normal rank
@@ Property / cites work @@
+Product graph representations
@@ Property / cites work: Product graph representations / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
+Normal rank
@@ Property / cites work @@
+On Isometric Embeddings of Graphs
@@ Property / cites work: On Isometric Embeddings of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph multiplication
@@ Property / cites work: Graph multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Factoring a graph in polynomial time
@@ Property / cites work: Factoring a graph in polynomial time / rank @@
+Normal rank
@@ Property / cites work @@
+Q3762348
@@ Property / cites work: Q3762348 / rank @@
+Normal rank