It is shown there that an infinite connected planar graph with a uniform upper bound on vertex degree and rapidly decreasing Green's function (relative to the simple random walk) has infinitely many pairwise finitely-intersecting ...