There is a mailing list for the seminar. In other words, the graph has a d -coloring that breaks all its symmetries, making the colored graph rigid.
G is the minimum d for which it is d -distinguishable.
In this talk we will discuss the complexity of computing the distingui- shing number of a graph. In particular, we will describe efficient algorithms for computing the distinguishing numbers of trees and planar graphs, and discuss an approach for bounded degree graphs.