Recognizing triangulated Cartesian graph products (Q658038): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2011.08.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2091195971
@@ Property / OpenAlex ID: W2091195971 / rank @@
+Normal rank
@@ Property / cites work @@
+Cartesian graph factorization at logarithmic cost per edge
+Normal rank
@@ Property / cites work @@
+Finding the prime factors of strong direct product graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+Local algorithms for the prime factorization of strong product graphs
+Normal rank
@@ Property / cites work @@
+Factoring cardinal product graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+Q4523707
@@ Property / cites work: Q4523707 / rank @@
+Normal rank
@@ Property / cites work @@
+Factoring directed graphs with respect to the cardinal product in polynomial time
+Normal rank
@@ Property / cites work @@
+Recognizing Cartesian products in linear time
@@ Property / cites work: Recognizing Cartesian products in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+The profile of the Cartesian product of graphs
@@ Property / cites work: The profile of the Cartesian product of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Profile minimization on products of graphs
@@ Property / cites work: Profile minimization on products of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Profile minimization on compositions of graphs
@@ Property / cites work: Profile minimization on compositions of graphs / rank @@
+Normal rank