Problem #WSP-000249

Problems Discrete Mathematics Graph Theory
 12–15  4.0

Problem

Starting at one of the vertices, an ant wishes to walk each of the \(12\) edges of a sugar cube exactly once. Prove that this is impossible.

image