Maximally edge-connected digraphs. - Angelika Hellwig; Lutz Volkmann (Australas. J Comb., 2003)

Maximally local-edge-connected graphs and digraphs. - Angelika Hellwig; Lutz Volkmann (Ars Comb., 2004)

Sufficient conditions for lambda'-optimality in graphs of diameter 2. - Angelika Hellwig; Lutz Volkmann (Discret. Math., 2004)

Note on the connectivity of line graphs. - Angelika Hellwig; Dieter Rautenbach; Lutz Volkmann (Inf. Process. Lett., 2004)

Neighborhood conditions for graphs and digraphs to be maximally edge-connected. - Angelika Hellwig; Lutz Volkmann (Australas. J Comb., 2005)

Cuts leaving components of given minimum order. - Angelika Hellwig; Dieter Rautenbach; Lutz Volkmann (Discret. Math., 2005)

Super connectivity of line graphs. - Jun-Ming Xu 001; Min Lü; Meijie Ma; Angelika Hellwig (Inf. Process. Lett., 2005)

Sufficient conditions for graphs to be lambda'-optimal, super-edge-connected, and maximally edge-connected. - Angelika Hellwig; Lutz Volkmann (J. Graph Theory, 2005)

Lower bounds on the vertex-connectivity of digraphs and graphs. - Angelika Hellwig; Lutz Volkmann (Inf. Process. Lett., 2006)

On connectivity in graphs with given clique number. - Angelika Hellwig; Lutz Volkmann (J. Graph Theory, 2006)

On the connectivity of diamond-free graphs. - Peter Dankelmann; Angelika Hellwig; Lutz Volkmann (Discret. Appl. Math., 2007)

The connectivity of a graph and its complement. - Angelika Hellwig; Lutz Volkmann (Discret. Appl. Math., 2008)

Maximally edge-connected and vertex-connected graphs and digraphs: A survey. - Angelika Hellwig; Lutz Volkmann (Discret. Math., 2008)

Inverse degree and edge-connectivity. - Peter Dankelmann; Angelika Hellwig; Lutz Volkmann (Discret. Math., 2009)