On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results (Q1044994): Difference between revisions

@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / 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 @@
+The distinguishing number of the hypercube
@@ Property / cites work: The distinguishing number of the hypercube / rank @@
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+The distinguishing number of the augmented cube and hypercube powers
+Normal rank
@@ Property / cites work @@
+On computing the distinguishing numbers of trees and forests
+Normal rank
@@ Property / cites work @@
+Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
+Normal rank
@@ Property / cites work @@
+The distinguishing chromatic number
@@ Property / cites work: The distinguishing chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+$O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
+Normal rank
@@ Property / cites work @@
+A Linear Time Algorithm for Deciding Interval Graph Isomorphism
+Normal rank
@@ Property / cites work @@
+A note on the asymptotic and computational complexity of graph distinguishability
+Normal rank