TY - JOUR A1 - Hellwig, Angelika A1 - Rautenbach, Dieter A1 - Volkmann, Lutz T1 - Cuts leaving components of given minimum order JF - Discrete mathematics Y1 - 2005 SN - 1872-681X (E-Journal); 0012-365X (Print) VL - Vol. 292 IS - Iss. 1-3 SP - 55 EP - 65 ER - TY - JOUR A1 - Dankelmann, Peter A1 - Hellwig, Angelika A1 - Volkmann, Lutz T1 - Inverse degree and edge-connectivity JF - Discrete mathematics Y1 - 2009 SN - 1872-681X (E-Journal); 0012-365X (Print) VL - Vol. 309 IS - Iss. 9 SP - 2943 EP - 2947 PB - Elsevier CY - Amsterdam ER - TY - JOUR A1 - Hellwig, Angelika A1 - Volkmann, Lutz T1 - Lower bounds on the vertex-connectivity of digraphs and graphs JF - Information processing letters Y1 - 2006 SN - 1872-6119 (E-Journal); 0020-0190 (Print) VL - Vol. 99 IS - Iss. 2 SP - 41 EP - 46 ER - TY - JOUR A1 - Hellwig, Angelika A1 - Volkmann, Lutz T1 - Maximally edge-connected and vertex-connected graphs and digraphs : a survey JF - Discrete mathematics Y1 - 2008 SN - 1872-681X (E-Journal); 0012-365X (Print) VL - Vol. 308 IS - Iss. 15 SP - 3265 EP - 3296 ER - TY - JOUR A1 - Hellwig, Angelika A1 - Volkmann, Lutz T1 - Maximally edge-connected digraphs JF - Australasian journal of combinatorics Y1 - 2003 SN - 1034-4942 (E-Journal); 1034-4942 (Print) VL - Vol. 27 SP - 23 EP - 32 ER - TY - JOUR A1 - Hellwig, Angelika A1 - Volkmann, Lutz T1 - Maximally local-edge-connected graphs and digraphs JF - Ars combinatoria Y1 - 2004 SN - 0381-7032 VL - Vol. 72 SP - 295 EP - 306 ER - TY - JOUR A1 - Hellwig, Angelika A1 - Volkmann, Lutz T1 - Neighborhood and degree conditions for super-edge-connected bipartite digraphs JF - Results in mathematics Y1 - 2004 SN - 1420-9012 (E-Journal); 1422-6383 (Print) VL - Vol. 45 IS - Iss. 1-2 SP - 45 EP - 58 ER - TY - JOUR A1 - Hellwig, Angelika A1 - Volkmann, Lutz T1 - Neighborhood conditions for graphs and digraphs to be maximally edge-connected JF - Australasian journal of combinatorics Y1 - 2005 SN - 10344942 ; 22023518 VL - Vol. 33 SP - 265 EP - 277 ER - TY - JOUR A1 - Hellwig, Angelika A1 - Rautenbach, Dieter A1 - Volkmann, Lutz T1 - Note on the connectivity of line graphs JF - Information processing letters Y1 - 2004 SN - 1872-6119 (E-Journal); 0020-0190 (Print) VL - Vol. 91 IS - Iss. 1 SP - 7 EP - 10 ER - TY - JOUR A1 - Hellwig, Angelika A1 - Volkmann, Lutz T1 - On connectivity in graphs with given clique number JF - Journal of graph theory Y1 - 2006 SN - 03649024 ; 10970118 VL - Vol. 52 IS - Iss. 1 SP - 7 EP - 14 ER - TY - JOUR A1 - Dankelmann, Peter A1 - Hellwig, Angelika A1 - Volkmann, Lutz T1 - On the connectivity of diamond-free graphs JF - Discrete applied mathematics Y1 - 2007 SN - 0166-218X (E-Journal); 1872-6771 (E-Journal); 0166-218X (Print) VL - Vol. 155 IS - Iss. 16 SP - 2111 EP - 2117 ER - TY - JOUR A1 - Hellwig, Angelika A1 - Volkmann, Lutz T1 - Some upper bounds for the domination number JF - The journal of combinatorial mathematics and combinatorial computing : JCMCC Y1 - 2006 SN - 0835-3026 VL - Vol. 57 SP - 187 EP - 209 ER - TY - JOUR A1 - Hellwig, Angelika A1 - Volkmann, Lutz T1 - Sufficient conditions for graphs to be λ′-optimal, super-edge-connected, and maximally edge-connected JF - Journal of graph theory Y1 - 2005 SN - 03649024 VL - Vol. 48 IS - Iss. 3 SP - 228 EP - 246 ER - TY - JOUR A1 - Hellwig, Angelika A1 - Volkmann, Lutz T1 - Sufficient conditions for λ′-optimality in graphs of diameter 2 JF - Discrete mathematics Y1 - 2004 SN - 1872-681X (E-Journal); 0012-365X (Print) VL - Vol. 283 IS - Iss. 1-3 SP - 113 EP - 120 ER - TY - JOUR A1 - Xu, Jung-Ming A1 - Lü, Min A1 - Ma, Meijie A1 - Hellwig, Angelika T1 - Super connectivity of line graphs JF - Information processing letters Y1 - 2005 SN - 1872-6119 (E-Journal); 0020-0190 (Print) VL - Vol. 94 IS - Iss. 4 SP - 191 EP - 195 ER - TY - JOUR A1 - Hellwig, Angelika A1 - Volkmann, Lutz T1 - The connectivity of a graph and its complement JF - Discrete applied mathematics Y1 - 2008 SN - 0166-218X (E-Journal); 1872-6771 (E-Journal); 0166-218X (Print) VL - Vol. 156 IS - Iss. 17 SP - 3325 EP - 3328 ER -