@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{KirschnerHermannsKlementzHaselhuhnetal.2011, author = {Kirschner-Hermanns, Ruth and Klementz, T. and Haselhuhn, Angelika and Jakse, Gerhard and Heidenreich, A. and Brehmer, Bernhard}, title = {Drangsymptomatik nach onkologisch erfolgreicher Prostatakarzinomtherapie : prospektive Studie zum Einfluss von Therapiemodalit{\"a}t, Morbidit{\"a}t und epidemiologischen Faktoren auf die Lebensqualit{\"a}t}, series = {Der Urologe}, volume = {Vol. 50}, journal = {Der Urologe}, number = {Iss. 11}, publisher = {Springer}, address = {Berlin}, issn = {1433-0563}, pages = {1412 -- 1419}, year = {2011}, language = {de} } @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{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} }