We study the existence of certain disjoint paths in planar graphs and
generalize a theorem of Thomassen on planarizing cycles in surfaces. R
esults are used to prove that every 5-connected triangulation of a sur
face with sufficiently large representativity is hamiltonian, thus ver
ifying a conjecture of Thomassen. We also obtain results about spannin
g walks in graphs embedded in a surface with large representativity.