1. Distinguishing geometric graphs;Albertson;J. Graph Theory,2006
2. Symmetry breaking in graphs;Albertson;Electron. J. Combin.,1996
3. M. Anderson, C. Barrientos, R. Brigham, J. Carrington, M. Kronman, R. Vitray, J. Yellen, The Irregular Chromatic Number of Some Graph Classes, Bull. Inst. Combin. Appl. (in press)
4. A fast algorithm for the construction of universal footprinting templates in DNA;Anderson;J. Math. Biol.,2006
5. Every planar map is four colorable;Appel;Bull. Amer. Math. Soc.,1976