Matthias Kriesell
Published 2011-01-12Version 1
A k-connected graph such that deleting any edge / deleting any vertex / contracting any edge results in a graph which is not k-connected is called minimally / critically / contraction-critically k-connected. These three classes play a prominent role in graph connectivity theory, and we give a brief introduction with a light emphasis on reduction- and construction theorems for classes of k-connected graphs.
Comments: IMADA-preprint-math, 33 pages
Related articles:
A Tight Bound for Minimal Connectivity
Critical and minimal connectivity of power graphs of finite groups
An upper bound on the Wiener Index of a k-connected graph
![QR code for arXiv:1101.2357 [math.CO]](http://oss.arxitics.com/images/favicon.svg)