On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture (Q2026341): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963335568
@@ Property / OpenAlex ID: W2963335568 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q123337000
@@ Property / Wikidata QID: Q123337000 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.04866
@@ Property / arXiv ID: 1608.04866 / rank @@
+Normal rank
@@ Property / cites work @@
+Distinguishing Cartesian powers of graphs
@@ Property / cites work: Distinguishing Cartesian powers of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Using determining sets to distinguish Kneser graphs
+Normal rank
@@ Property / cites work @@
+Symmetry breaking in graphs
@@ Property / cites work: Symmetry breaking in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4949875
@@ Property / cites work: Q4949875 / 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 @@
+Distinguishing number and adjacency properties
@@ Property / cites work: Distinguishing number and adjacency properties / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying graph automorphisms using determining sets
+Normal rank
@@ Property / cites work @@
+The cost of 2-distinguishing Cartesian powers
@@ Property / cites work: The cost of 2-distinguishing Cartesian powers / rank @@
+Normal rank
@@ Property / cites work @@
+Q5298911
@@ Property / cites work: Q5298911 / rank @@
+Normal rank
@@ Property / cites work @@
+On computing the distinguishing numbers of trees and forests
+Normal rank
@@ Property / cites work @@
+On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
+Normal rank
@@ Property / cites work @@
+Destroying automorphisms by fixing nodes
@@ Property / cites work: Destroying automorphisms by fixing nodes / rank @@
+Normal rank
@@ Property / cites work @@
+Distinguishing Cartesian products of countable graphs
+Normal rank
@@ Property / cites work @@
+Distinguishing colorings of Cartesian products of complete graphs
+Normal rank
@@ Property / cites work @@
+Trivial Set-Stabilizers in Finite Permutation Groups
+Normal rank
@@ Property / cites work @@
+The distinguishing number of Cartesian products of complete graphs
+Normal rank
@@ Property / cites work @@
+Distinguishing Cartesian powers of graphs
@@ Property / cites work: Distinguishing Cartesian powers of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Distinguishing infinite graphs
@@ Property / cites work: Distinguishing infinite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Cartesian powers of graphs can be distinguished by two labels
+Normal rank
@@ Property / cites work @@
+Distinguishing number of countable homogeneous relational structures
+Normal rank
@@ Property / cites work @@
+Finite factors of Bernoulli schemes and distinguishing labelings of directed graphs
+Normal rank
@@ Property / cites work @@
+Symmetry breaking in tournaments
@@ Property / cites work: Symmetry breaking in tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Another proof of Gluck's theorem
@@ Property / cites work: Another proof of Gluck's theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Bounding the distinguishing number of infinite graphs and permutation groups
+Normal rank
@@ Property / cites work @@
+Distinguishability of locally finite trees
@@ Property / cites work: Distinguishability of locally finite trees / rank @@
+Normal rank