Graph Theory: 53. Cut-Vertices
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.
Related videos:
• Graph Theory: 54. Number of Cut-Vertices - GT 54 Maximum number of cut-vertices possible
• Graph Theory: 05. Connected and Regular Gr... - GT 05. Connected and Regular Graphs
For quick videos about Math tips and useful facts, check out my other channel
"Spoonful of Maths" - / spoonfulofmaths