Fixing numbers of graphs and groups.
Gibbons, Courtney R., Laison, Joshua D. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Distinguishing maps.”
Fixing numbers of graphs and groups.
Symmetry breaking in graphs.
Albertson, Michael O., Collins, Karen L. (1996)
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:
Involutory Pairs of Vertices in Transitive Graphs
Bohdan Zelinka (1975)
Matematický časopis
Similarity:
Bounds on the distinguishing chromatic number.
Collins, Karen L., Hovey, Mark, Trenk, Ann N. (2009)
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:
Finite Vertex-Transitive Planar Graphs of the Regularity Degree Four or Five
Bohdan Zelinka (1975)
Matematický časopis
Similarity:
Avoiding rainbow induced subgraphs in vertex-colorings.
Axenovich, Maria, Martin, Ryan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: