3 ms·
The proof of the characterisation of Eulerian graphs is really neat and one of my favourites. It basically just starts with "choose a maximal trail" and the res
by Tainnor 7y ago
The proof of the characterisation of Eulerian graphs is really neat and one of my favourites. It basically just starts with "choose a maximal trail" and the rest writes itself if you think about it long enough.