Accessibility, planar graphs, and quasi-isometries

Joseph Paul MacManus

We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of t…