Discrete Math II - 10.5.2 Hamilton Paths and Circuits

We finish up section 10.5 by examining if it is possible to visit every vertex in a graph, rather than every edge in a graph. Unfortunately, there is no algorithm and there is little guidance for whether or not a Hamiltonian path or circuit exists.

Video Chapters:
Intro 0:00
What is a Hamilton Circuit (or path) 0:15
What we Know about Hamilton Circuits 1:46
Hamilton Practice 4:37
Up Next 7:38

This playlist uses Discrete Mathematics and Its Applications, Rosen 8e

Power Point slide decks to accompany the videos can be found here:

The entire playlist can be found here:

[andrewoodward]

"We're gonna just wing it" is crazy.

[AMAZINGDAVE]

Hi,
Please I just wanted to ask whether you have a video on difference operator in Discrete math?

[TahaAliKhan-muzk]

Kimberly you are a great teacher but unfortunately this topic was not well explained, watched it 3 times and still confused