@article{HellwigVolkmann2008,
  author    = {Hellwig, Angelika and Volkmann, Lutz},
  title     = {Maximally edge-connected and vertex-connected graphs and digraphs : a survey},
  series = {Discrete mathematics},
  volume    = {Vol. 308},
  journal   = {Discrete mathematics},
  number    = {Iss. 15},
  issn      = {1872-681X (E-Journal); 0012-365X (Print)},
  pages     = {3265 -- 3296},
  year      = {2008},
  language  = {en}
}
@article{HellwigVolkmann2006,
  author    = {Hellwig, Angelika and Volkmann, Lutz},
  title     = {Lower bounds on the vertex-connectivity of digraphs and graphs},
  series = {Information processing letters},
  volume    = {Vol. 99},
  journal   = {Information processing letters},
  number    = {Iss. 2},
  issn      = {1872-6119 (E-Journal); 0020-0190 (Print)},
  pages     = {41 -- 46},
  year      = {2006},
  language  = {en}
}
@article{DankelmannHellwigVolkmann2009,
  author    = {Dankelmann, Peter and Hellwig, Angelika and Volkmann, Lutz},
  title     = {Inverse degree and edge-connectivity},
  series = {Discrete mathematics},
  volume    = {Vol. 309},
  journal   = {Discrete mathematics},
  number    = {Iss. 9},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {1872-681X (E-Journal); 0012-365X (Print)},
  pages     = {2943 -- 2947},
  year      = {2009},
  language  = {en}
}
@article{HellwigRautenbachVolkmann2005,
  author    = {Hellwig, Angelika and Rautenbach, Dieter and Volkmann, Lutz},
  title     = {Cuts leaving components of given minimum order},
  series = {Discrete mathematics},
  volume    = {Vol. 292},
  journal   = {Discrete mathematics},
  number    = {Iss. 1-3},
  issn      = {1872-681X (E-Journal); 0012-365X (Print)},
  pages     = {55 -- 65},
  year      = {2005},
  language  = {en}
}