Discrete Math II/Combinatorics (Entire course) - 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: https://bellevueuniversity-my.sharepoint.com/:f:/g/personal/kbrehm_bellevue_edu/Ei9DcmrOBTlAuMxWUoq9ZqsB14M60jcpob-xdAYS6ruVWw?e=uP9KN0 The entire playlist can be found here: https://www.youtube.com/playlist?list=PLl-gb0E4MII0sGLCJeqDB3y63HZ6lM5LJ