Proving "A graph $G$ with chromatic number $𝑘$ has a proper coloring with a walk with $k$ vertices in $k$ different colors" by induction
An $m$ coloured graph must have a path with each vertex taking up one colour each