Graph Theory: Euler Paths and Euler Circuits

This lesson explains Euler paths and Euler circuits. Several examples are provided.

[ChrisMCastro]

I read a whole chapter on this only to find myself lost. I watched this video and now I get it. 

[bowlofrice]

The textbook is so convoluted that i read, but this video made it more than just simple to digest and understand

[bevanp]

Your elucidation cleared every doubt of mine. Thanks a bunch for this short tutorial

[Jennip]

Thank you. I cant seem to learn from my teacher, she's way AdHd. This taught me in a snap!

[chavalit]

Thanks sir.. In 2 days im going to answer these euler and hamiltonian question thank you sir I understand more than my lecturer taught me

[janeenriquez]

Very helpful 👍 especially most of the classes are modular because of pandemic. Thank you !

[d.k.]

But in path Travers we can't repeat vertex so, I have a dought that why are you repeat ing vertex in eular graph ans me

[JeremiahSwashbuckler]

I"m Confused in the very first example it started at C then to B and Then to A but then went from A back to C before going from C to D. If an Euler Path has no repeats wouldnt starting from C and then going from A back to C repeating C?

[nageensaira]

wonderful well explained then professor's 1-hour lecture and book 2 to 3 pages explanation.

[tasfiatabassum]

it was really helpful. Thanks a lot for giving so much of your time to help students. I really mean it. Thanks :)

[eifet]

The theorem do help to find an Euler path, it states that the start and end vertices have to have odd degree. So you always start and end on odd degree vertices, afaik

[TorresVr]

I did find the video helpful. Thank you for the good explanation.

[yashshhreya]

Is it possible two have euler circuit without being euler path ?
Kn complete graph n greater than 4

[jeremiahabbott]

So a path can start and end at any path and only use the line’s connecting them once. A circuit can start at any point but it must end at that same point without using any lines more than once.

[Joey_Decker]

For the Euler Circuit, how does going from E to B twice not count as a repeat?

[woongbin]

are there any way to know how many euler paths are there in a graph?

[tylerruiz]

Great Video, Greetings from Universidad de Guadalajara, Mexico!

[zooz]

I'm really really thankful for this account .... it's help me to understand

[onlinesurvays]

but in second eg path visiting A twice how could it satisfy. eulars path

[NZIGNANTI]

@6:00 is the best definition ever for NO EULER PATH.