  A $t$-nearly platonic graph is a finite, connected, regular, simple and
planar graph in which all but exactly $t$ numbers of its faces have the same
length. It is proved that there is no 2-connected $1$-nearly platonic graph. In
this paper, we prove that there is no $1$-nearly platonic graph.
