An Euler Path walks through a graph, going from vertex to vertex, hitting each edge exactly once. But only some types of graphs have these Euler Paths, it depends on the degree of the vertices. We state and motivate the big theorem, and then use it to solve the infamous 7 bridges of Konigsberg problem that motivated Euler to start studying graph theory.

►FULL DISCRETE MATH PLAYLIST:    • Discrete Math (Full Course: Sets, Log...  

OTHER COURSE PLAYLISTS:
►CALCULUS I:    • Calculus I (Limits, Derivative, Integ...  
► CALCULUS II:    • Calculus II (Integration Methods, Ser...  
►MULTIVARIABLE CALCULUS (Calc III):    • Calculus III: Multivariable Calculus ...  
►VECTOR CALCULUS (Calc IV):    • Calculus IV: Vector Calculus (Line In...  
►DIFFERENTIAL EQUATIONS:    • How to solve ODEs with infinite serie...  
►LINEAR ALGEBRA:    • Linear Algebra (Full Course)  

OTHER PLAYLISTS:
► Learning Math Series
   • 5 Tips To Make Math Practice Problems...  
►Cool Math Series:
   • Cool Math Series  

BECOME A MEMBER:
►Join:    / @drtrefor  

MATH BOOKS & MERCH I LOVE:
► My Amazon Affiliate Shop: https://www.amazon.com/shop/treforbazett

SOCIALS:
►Twitter (math based):   / treforbazett  
►Instagram (photography based):   / treforphotography