One-way infinite 2-walks in planar graphs

Daniel P. Biebighauser, M. N. Ellingham

We prove that every 3-connected 2-indivisible infinite planar graph has a 1-way infinite 2-walk. (A graph is 2-indivisible if deleting finitely many vertices leaves at most one inf…