1. Collins, K.L., Trenk, A.: The distinguishing chromatic number. Electron. J. Combin. 13(1), R16 (2006)
2. Fijavž, G., Negami, S., Sano, T.: 3-Connected planar graphs are 5-distinguishing colorable with two exceptions. Ars Math. Contemp. 4(1), 165–175 (2011)
3. Negami, S., Sakurai, S.: Distinguishing chromatic numbers of planar graphs. Yokohama Math. J. 55, 179–188 (2010)
4. Negami, S., Tucker, T.W.: Bipartite polyhedral maps on closed surfaces are distinguishing 3-colorable with few exceptions (2014, in preparation)
5. Sano, T., Negami, S.: The distinguishing chromatic numbers of triangulations on the projective plane. Congr. Numer. 206, 131–137 (2010)