3-Connected planar graphs are 5-distinguishing colorable with two exceptions. - Gasper Fijavz; Seiya Negami; Terukazu Sano (Ars Math. Contemp., 2011)

Covering projective planar graphs with three forests. - Raiji Mukae; Kenta Ozeki; Terukazu Sano; Ryuji Tazume (Discret. Math., 2022)