Combinatorics and Graph Theory · Problem 5.2.3

Graph Theory — David Guichard

Mathematics — Combinatorics · euler-circuits-and-walks

Problem

Prove that if vertices

v

and

w

are joined by a walk they are joined by a path.