Fixing numbers of graphs and groups.
Gibbons, Courtney R., Laison, Joshua D. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Bounds on the distinguishing chromatic number.”
Fixing numbers of graphs and groups.
Distinguishing maps.
Tucker, Thomas W. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Symmetry breaking in graphs.
Albertson, Michael O., Collins, Karen L. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Identifying graph automorphisms using determining sets.
Boutin, Debra L. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Using determining sets to distinguish Kneser graphs.
Albertson, Michael O., Boutin, Debra L. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The distinguishing chromatic number.
Collins, Karen L., Trenk, Ann N. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Distinguishing Cartesian powers of graphs.
Albertson, Michael O. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Automorphism groups of certain unstable graphs
David B. Surowski (2003)
Mathematica Slovaca
Similarity:
Involutory Pairs of Vertices in Transitive Graphs
Bohdan Zelinka (1975)
Matematický časopis
Similarity:
The list Distinguishing Number Equals the Distinguishing Number for Interval Graphs
Poppy Immel, Paul S. Wenger (2017)
Discussiones Mathematicae Graph Theory
Similarity:
A distinguishing coloring of a graph G is a coloring of the vertices so that every nontrivial automorphism of G maps some vertex to a vertex with a different color. The distinguishing number of G is the minimum k such that G has a distinguishing coloring where each vertex is assigned a color from {1, . . . , k}. A list assignment to G is an assignment L = {L(v)}v∈V (G) of lists of colors to the vertices of G. A distinguishing L-coloring of G is a distinguishing coloring of G where the...