  The Wiener index of a connected graph is the sum of the distances between all
unordered pairs of vertices. We provide formulae for the minimum Wiener index
of simple triangulations and quadrangulations with connectivity at least $c$,
and provide the extremal structures, which attain those values. Our main tool
is setting upper bounds for the maximum degree in highly connected
triangulations and quadrangulations.
