1. The Design and Analysis of Algorithms;Aho,1974
2. Symmetry breaking in graphs;Albertson;Electronic Journal of Combinatorics,1996
3. On computing the distinguishing numbers of planar graphs and beyond: A counting approach;Arvind;SIAM Journal on Discrete Mathematics,2008
4. V. Arvind, N. Devanur, Symmetry breaking in trees and planar graphs by vertex coloring, in: Proceedings of the Nordic Combinatorial Conference, 2004
5. The distinguishing number of the hypercube;Bogstad;Discrete Mathematics,2004