On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two (Q626859): Difference between revisions

@@ Property / author @@
-Lorna K. Stewart
@@ Property / author: Lorna K. Stewart / rank @@
-Normal rank
@@ Property / author @@
+Lorna K. Stewart
@@ Property / author: Lorna K. Stewart / rank @@
+Normal rank
@@ 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.1016/j.disc.2010.12.013
+Normal rank
@@ Property / OpenAlex ID @@
+W2030889781
@@ Property / OpenAlex ID: W2030889781 / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetry breaking in graphs
@@ Property / cites work: Symmetry breaking in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
+Normal rank
@@ Property / cites work @@
+On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
+Normal rank
@@ Property / cites work @@
+The distinguishing chromatic number
@@ Property / cites work: The distinguishing chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273947
@@ Property / cites work: Q4273947 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Structure of Polynomial Time Reducibility
@@ Property / cites work: On the Structure of Polynomial Time Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the asymptotic and computational complexity of graph distinguishability
+Normal rank
@@ Property / cites work @@
+Q3392275
@@ Property / cites work: Q3392275 / rank @@
+Normal rank