# Vizing's Theorem haiku

Induction on n.

Swap available colours

and find SDR.

Swap available colours

and find SDR.

My most recent talk in UVic’s discrete math seminar presented three poetic proofs by Adrian Bondy.Short proofs of classical theorems. *Journal of Graph Theory* 44(3). J Adrian Bondy (2003).

Slides of the talk can be found here.

Induction on n.

Swap available colours

and find SDR.

Swap available colours

and find SDR.

A red-blue $K_n$:

bluest Hamilton circuit

lies fully in $G$.

bluest Hamilton circuit

lies fully in $G$.

Greedily colour,

ensuring neighbours follow

all except the last.

Choose the last vertex wisely:

friend of few or of leaders.

ensuring neighbours follow

all except the last.

Choose the last vertex wisely:

friend of few or of leaders.