Combinatorics and Graph Theory · Problem 5.2.2

Graph Theory — David Guichard

Mathematics — Combinatorics · euler-circuits-and-walks

Problem

Which complete graphs KnK_n, n≥2n \geq 2, have Euler circuits? Which have Euler walks? Justify your answers.

Related theory

Browse the problem library