Infinite paths in planar graphs V, 3‐indivisible graphs
Xingxing Yu · Journal of Graph Theory · 2007
Abstract We prove Nash‐Williams' conjecture that every 4‐connected, 3‐indivisible, infinite, planar graph contains a spanning 2‐way infinite path. A graph is said to be 3‐indivisible if the deletion of any finite set of vertices results in at most two infinite components. © 2007 Wiley Periodicals, Inc. J Graph Theory 57: 275–312, 2008