Graph Theory: 53. Cut-Vertices HD

Here we introduce the term cut-vertex and show a few examples where we find the cut-vertices of graphs. We then go through a proof of a characterisation of cut-vertices: a vertex v is a cut-vertex if and only if there exist vertices u and w (distinct from v) such that v lies on every u-w path in the graph. -- Bits of Graph Theory by Dr. Sarada Herke. BIG NEWS - Check out my new course on UDEMY - College Math Essentials: Logarithms https://www.udemy.com/college-math-essentials-logarithms/?couponCode=SaradaYT Related videos: http://youtu.be/mPI8_qZm1_8 - GT 54 Maximum number of cut-vertices possible http://youtu.be/BEyuUXQs5ko - GT 05. Connected and Regular Graphs For quick videos about Math tips and useful facts, check out my other channel "Spoonful of Maths" - http://youtube.com/spoonfulofmaths --- Links --- Website - http://saradaherke.com Facebook - https://www.facebook.com/DrSaradaHerke Twitter - https://twitter.com/SaradaHerke Twitter - https://twitter.com/spoonfulofmaths Google Plus - https://plus.google.com/+SaradaHerke