Guichard-Combinatorics-Graph-Theory · Problem 5.2.2

Graph Theory

Mathematics — Probability · euler-circuits-and-walks

Problem

Which complete graphs

K_n

n \geq 2

, have Euler circuits? Which have Euler walks? Justify your answers.