König's Lemma/Proof 3

Theorem
Let $G$ be an infinite graph which is connected and is locally finite.

Then every vertex lies on a path of infinite length.

Proof
By Locally Finite Connected Graph is Countable, $G$ has countably many vertices.

Thus the result holds by König's Lemma: Countable.