@article{oai:ynu.repo.nii.ac.jp:00006959,
 author = {Hara, Shosaku},
 issue = {Special},
 journal = {Yokohama Mathematical Journal = 横濱市立大學紀要. D部門, 数学},
 month = {},
 note = {application/pdf, The achromatic number of a graph ＄G＄ is the maximum number ＄k＄ such that ＄G＄ has a k-coloring each pair of whose colors appear at the ends of an edge. We shall show that a triangulation ＄G＄ of a closed surface has achromatic number 3 if and only if ＄G＄ is isomorphic to ＄K_{n,n,n}＄ for some ＄n＄ .},
 pages = {225--229},
 title = {TRIANGURATIONS OF CLOSED SURFACES WITH ACHROMATIC NUMBER 3},
 volume = {47},
 year = {1999}
}