Spanning paths in infinite planar graphs
Nathaniel Dean, Robin B. Thomas, Xingxing Yu · Journal of Graph Theory · 1996
Let G be a 4-connected infinite planar graph such that the deletion of any finite set of vertices of G results in at most one infinite component. We prove a conjecture of Nash-Williams that G has a 1-way infinite spanning path. © 1996 John Wiley & Sons, Inc.