In this paper we show that for each n there is a triangulation of an o
rientable surface which is it-connected, n-representative, and such th
at every spanning tree contains a vertex of degree at least n. This al
so shows that there exist such graphs where any spanning walk must vis
it some vertex at least n times. We show the analogous results for non
orientable surfaces. (C) 1996 Academic Press, Inc.