We introduce the concept of (coarse) n-point bottlenecking in graphs and study the coarse geometry of graphs in terms of bottlenecking in their coarse skeletons. We examine the connections of bottlenecking with coarse planarity. This is joint work with Atish Mitra and Heidi Steiger.