We show an upper bound for the maximum vertex degree
of any z-oblique graph imbedded into a given surface. Moreover, an upper bound for the
maximum face degree is presented. We also show that there are only finitely many oblique
graphs imbedded into non-orientable surfaces.