Let be a given graph. A graph is -linked if, for any injective map , contains a subdivision of rooted at the images of . A classic result of Seymour and Thomassen shows that every 4-connected plane triangulation is -linked. Ellingham, Plummer and Yu proved that every 4-connected plane triangulation is -linked. However, not all 4-connected surface triangulation is -linked. In this talk, we focus on some recent developments on graph linkages on surfaces. This is based on joint work with Moser, Stephens, and Zha.