I continue discussing paths and cycles. I show that we can always find a path that is at least as long as the minimum degree of G. The material follows Diestel's "Graph Theory", section 1.3.