Graph Theory 2: Eulerian Paths & Circuits

preview_player
Показать описание
Second in series of mini-lectures on graph theory.
Рекомендации по теме
Комментарии
Автор

Thanks sm for the video!! It's so clear and helped me understand a lot more than my professor. Also, thanks for making mistakes and having moments where you had to think for a second haha they gave me a nice laugh and breather from all the content, but also helped keep me paying attention once I caught them.

kellyy
Автор

Can there be an Eulerian cycle where we "paint us into a corner" where we cannot complete the path through all vertices with using every edge only once? It seems to me now No, there cannot be such a cycle, but how would I prove it?

Achill
Автор

Can a graph with a single node have an Eulerian Path?

MinecraftMRCentral