1. T. Fukuda, S. Negami and T. Tucker, 3-Connected planar graphs are 2-distinguishable with few exceptions, to appear in Yokohama Math. J. 2007
2. Re-embedding structures of triangulations on closed surfaces;Nakamoto;Sci. Rep. Yokohama Nat. Univ., Sec. I,1997
3. S. Negami, The distinguishing numbers of graphs on closed surfaces, preprint in 2007
4. The distinguishing numbers of triangulations on the projective plane;Negami;Congressus Numernatium,2007
5. S. Negami and T. Sano, The disntinguishing number of triangulations on the torus, preprint in 2007