Let S be a nonorientable surface. A collection of pairwise noncrossing simple closed curves in S is a blockage if every onesided simple closed curve in S crosses at least one of them. Robertson and Thomas [9] conjectured that the orientable genus of any graph G embedded in S with sufficiently large face-width is “roughly” equal to one half of the minimum number of intersections of a blockage wi...