@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}
}
@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{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{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{HellwigVolkmann2003,
  author    = {Hellwig, Angelika and Volkmann, Lutz},
  title     = {Maximally edge-connected digraphs},
  series = {Australasian journal of combinatorics},
  volume    = {Vol. 27},
  journal   = {Australasian journal of combinatorics},
  issn      = {1034-4942 (E-Journal); 1034-4942 (Print)},
  pages     = {23 -- 32},
  year      = {2003},
  language  = {en}
}
@article{HellwigVolkmann2004,
  author    = {Hellwig, Angelika and Volkmann, Lutz},
  title     = {Maximally local-edge-connected graphs and digraphs},
  series = {Ars combinatoria},
  volume    = {Vol. 72},
  journal   = {Ars combinatoria},
  issn      = {0381-7032},
  pages     = {295 -- 306},
  year      = {2004},
  language  = {en}
}
@article{HellwigVolkmann2004,
  author    = {Hellwig, Angelika and Volkmann, Lutz},
  title     = {Neighborhood and degree conditions for super-edge-connected bipartite digraphs},
  series = {Results in mathematics},
  volume    = {Vol. 45},
  journal   = {Results in mathematics},
  number    = {Iss. 1-2},
  issn      = {1420-9012 (E-Journal); 1422-6383 (Print)},
  pages     = {45 -- 58},
  year      = {2004},
  language  = {en}
}
@article{HellwigVolkmann2005,
  author    = {Hellwig, Angelika and Volkmann, Lutz},
  title     = {Neighborhood conditions for graphs and digraphs to be maximally edge-connected},
  series = {Australasian journal of combinatorics},
  volume    = {Vol. 33},
  journal   = {Australasian journal of combinatorics},
  issn      = {10344942 ; 22023518},
  pages     = {265 -- 277},
  year      = {2005},
  language  = {en}
}
@article{HellwigRautenbachVolkmann2004,
  author    = {Hellwig, Angelika and Rautenbach, Dieter and Volkmann, Lutz},
  title     = {Note on the connectivity of line graphs},
  series = {Information processing letters},
  volume    = {Vol. 91},
  journal   = {Information processing letters},
  number    = {Iss. 1},
  issn      = {1872-6119 (E-Journal); 0020-0190 (Print)},
  pages     = {7 -- 10},
  year      = {2004},
  language  = {en}
}
@article{HellwigVolkmann2006,
  author    = {Hellwig, Angelika and Volkmann, Lutz},
  title     = {On connectivity in graphs with given clique number},
  series = {Journal of graph theory},
  volume    = {Vol. 52},
  journal   = {Journal of graph theory},
  number    = {Iss. 1},
  issn      = {03649024 ; 10970118},
  pages     = {7 -- 14},
  year      = {2006},
  language  = {en}
}
@article{DankelmannHellwigVolkmann2007,
  author    = {Dankelmann, Peter and Hellwig, Angelika and Volkmann, Lutz},
  title     = {On the connectivity of diamond-free graphs},
  series = {Discrete applied mathematics},
  volume    = {Vol. 155},
  journal   = {Discrete applied mathematics},
  number    = {Iss. 16},
  issn      = {0166-218X (E-Journal); 1872-6771 (E-Journal); 0166-218X (Print)},
  pages     = {2111 -- 2117},
  year      = {2007},
  language  = {en}
}
@article{HellwigVolkmann2006,
  author    = {Hellwig, Angelika and Volkmann, Lutz},
  title     = {Some upper bounds for the domination number},
  series = {The journal of combinatorial mathematics and combinatorial computing : JCMCC},
  volume    = {Vol. 57},
  journal   = {The journal of combinatorial mathematics and combinatorial computing : JCMCC},
  issn      = {0835-3026},
  pages     = {187 -- 209},
  year      = {2006},
  language  = {en}
}
@article{HellwigVolkmann2005,
  author    = {Hellwig, Angelika and Volkmann, Lutz},
  title     = {Sufficient conditions for graphs to be λ′-optimal, super-edge-connected, and maximally edge-connected},
  series = {Journal of graph theory},
  volume    = {Vol. 48},
  journal   = {Journal of graph theory},
  number    = {Iss. 3},
  issn      = {03649024},
  pages     = {228 -- 246},
  year      = {2005},
  language  = {en}
}
@article{HellwigVolkmann2004,
  author    = {Hellwig, Angelika and Volkmann, Lutz},
  title     = {Sufficient conditions for λ′-optimality in graphs of diameter 2},
  series = {Discrete mathematics},
  volume    = {Vol. 283},
  journal   = {Discrete mathematics},
  number    = {Iss. 1-3},
  issn      = {1872-681X (E-Journal); 0012-365X (Print)},
  pages     = {113 -- 120},
  year      = {2004},
  language  = {en}
}
@article{XuLueMaetal.2005,
  author    = {Xu, Jung-Ming and L{\"u}, Min and Ma, Meijie and Hellwig, Angelika},
  title     = {Super connectivity of line graphs},
  series = {Information processing letters},
  volume    = {Vol. 94},
  journal   = {Information processing letters},
  number    = {Iss. 4},
  issn      = {1872-6119 (E-Journal); 0020-0190 (Print)},
  pages     = {191 -- 195},
  year      = {2005},
  language  = {en}
}
@article{HellwigVolkmann2008,
  author    = {Hellwig, Angelika and Volkmann, Lutz},
  title     = {The connectivity of a graph and its complement},
  series = {Discrete applied mathematics},
  volume    = {Vol. 156},
  journal   = {Discrete applied mathematics},
  number    = {Iss. 17},
  issn      = {0166-218X (E-Journal); 1872-6771 (E-Journal); 0166-218X (Print)},
  pages     = {3325 -- 3328},
  year      = {2008},
  language  = {en}
}