Q5708617 (Q5708617): Difference between revisions

@@ Property / cites work @@
+Finding the prime factors of strong direct product graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+Analogues of the Shannon Capacity of a Graph
@@ Property / cites work: Analogues of the Shannon Capacity of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of H-coloring
@@ Property / cites work: On the complexity of H-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q4523707
@@ Property / cites work: Q4523707 / rank @@
+Normal rank
@@ Property / cites work @@
+Smallest independent dominating sets in Kronecker products of cycles
+Normal rank
@@ Property / cites work @@
+Strong products of \(\chi\)-critical graphs
@@ Property / cites work: Strong products of \(\chi\)-critical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring graph products---a survey
@@ Property / cites work: Coloring graph products---a survey / rank @@
+Normal rank
@@ Property / cites work @@
+On the Shannon capacity of a graph
@@ Property / cites work: On the Shannon capacity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A randomised 3-colouring algorithm
@@ Property / cites work: A randomised 3-colouring algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Graph multiplication
@@ Property / cites work: Graph multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+The independence number of the strong product of cycles
+Normal rank
@@ Property / cites work @@
+A randomized algorithm for \(k\)-colorability
@@ Property / cites work: A randomized algorithm for \(k\)-colorability / rank @@
+Normal rank