Discrete Math II/Combinatorics (Entire course) - Discrete Math II - 10.5.1 Euler Paths and Circuits

Further developing our graph knowledge, we revisit the Bridges of Konigsberg problem to determine how Euler determined that traversing each bridge once and only once was impossible. We then make explicit the conditions that must be met for both undirected and directed graphs to have either an Euler circuit or Euler path. We finish with a few practice. Video Chapters: Intro 0:00 Revising the Bridges of Konigsberg 0:18 Euler Circuit Necessary Conditions - Undirected Graphs 1:22 Euler Circuit Necessary Conditions - Directed Graphs 6:50 A Bit-String Example 10:53 Up Next 17:19 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