Minimal Connectivity

Matthias Kriesell

Minimal Connectivity

Combinatorics 2011-01-13 v1

Authors: Matthias Kriesell

Abstract

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.

Keywords

graph connectivity graph theory rainbow connection

Cite

@article{arxiv.1101.2357,
  title  = {Minimal Connectivity},
  author = {Matthias Kriesell},
  journal= {arXiv preprint arXiv:1101.2357},
  year   = {2011}
}