Dankelmann, Peter; Hellwig, Angelika; Volkmann, Lutz Inverse degree and edge-connectivity. (English) Zbl 1203.05082 Discrete Math. 309, No. 9, 2943-2947 (2009). MSC: 05C40 PDFBibTeX XMLCite \textit{P. Dankelmann} et al., Discrete Math. 309, No. 9, 2943--2947 (2009; Zbl 1203.05082) Full Text: DOI
Hellwig, Angelika; Volkmann, Lutz Maximally edge-connected and vertex-connected graphs and digraphs: A survey. (English) Zbl 1160.05038 Discrete Math. 308, No. 15, 3265-3296 (2008). MSC: 05C40 05C20 05C35 05-02 PDFBibTeX XMLCite \textit{A. Hellwig} and \textit{L. Volkmann}, Discrete Math. 308, No. 15, 3265--3296 (2008; Zbl 1160.05038) Full Text: DOI
Xu, Jun-Ming; Lü, Min; Ma, Meijie; Hellwig, Angelika Super connectivity of line graphs. (English) Zbl 1184.68366 Inf. Process. Lett. 94, No. 4, 191-195 (2005). MSC: 68R10 05C40 PDFBibTeX XMLCite \textit{J.-M. Xu} et al., Inf. Process. Lett. 94, No. 4, 191--195 (2005; Zbl 1184.68366) Full Text: DOI
Hellwig, Angelika; Rautenbach, Dieter; Volkmann, Lutz Cuts leaving components of given minimum order. (English) Zbl 1063.05079 Discrete Math. 292, No. 1-3, 55-65 (2005). Reviewer: M. Hager (Leonberg) MSC: 05C40 PDFBibTeX XMLCite \textit{A. Hellwig} et al., Discrete Math. 292, No. 1--3, 55--65 (2005; Zbl 1063.05079) Full Text: DOI
Hellwig, Angelika; Volkmann, Lutz Neighborhood and degree conditions for super-edge-connected bipartite digraphs. (English) Zbl 1050.05075 Result. Math. 45, No. 1-2, 45-58 (2004). Reviewer: Linda Lesniak (Madison) MSC: 05C40 05C20 PDFBibTeX XMLCite \textit{A. Hellwig} and \textit{L. Volkmann}, Result. Math. 45, No. 1--2, 45--58 (2004; Zbl 1050.05075) Full Text: DOI
Hellwig, Angelika; Volkmann, Lutz Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2. (English) Zbl 1042.05056 Discrete Math. 283, No. 1-3, 113-120 (2004). MSC: 05C40 PDFBibTeX XMLCite \textit{A. Hellwig} and \textit{L. Volkmann}, Discrete Math. 283, No. 1--3, 113--120 (2004; Zbl 1042.05056) Full Text: DOI