Before revision:  In this paper, we study the Reachability problem on three distinct graph families -- intersection graphs of Jordan regions, unit contact disk graphs (penny graphs), and chordal graphs.
After revision:  In this paper, we study the Reachability problem on three distinct graph families - intersection graphs of Jordan regions, unit contact disk graphs (penny graphs), and chordal graphs.