Angelika Hellwig

14 papers Journal 14
YearRankTypeTitle / Venue / Authors
2009 J jnl
Inverse degree and edge-connectivity.
Discret. Math.
Peter Dankelmann, Angelika Hellwig, Lutz Volkmann
2008 J jnl
Maximally edge-connected and vertex-connected graphs and digraphs: A survey.
Discret. Math.
Angelika Hellwig, Lutz Volkmann
2008 J jnl
The connectivity of a graph and its complement.
Discret. Appl. Math.
Angelika Hellwig, Lutz Volkmann
2007 J jnl
On the connectivity of diamond-free graphs.
Discret. Appl. Math.
Peter Dankelmann, Angelika Hellwig, Lutz Volkmann
2006 J jnl
Lower bounds on the vertex-connectivity of digraphs and graphs.
Inf. Process. Lett.
Angelika Hellwig, Lutz Volkmann
2006 J jnl
On connectivity in graphs with given clique number.
J. Graph Theory
Angelika Hellwig, Lutz Volkmann
2005 J jnl
Cuts leaving components of given minimum order.
Discret. Math.
Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann
2005 J jnl
Neighborhood conditions for graphs and digraphs to be maximally edge-connected.
Australas. J Comb.
Angelika Hellwig, Lutz Volkmann
2005 J jnl
Sufficient conditions for graphs to be lambda'-optimal, super-edge-connected, and maximally edge-connected.
J. Graph Theory
Angelika Hellwig, Lutz Volkmann
2005 J jnl
Super connectivity of line graphs.
Inf. Process. Lett.
Jun-Ming Xu, Min Lü, Meijie Ma, Angelika Hellwig
2004 J jnl
Maximally local-edge-connected graphs and digraphs.
Ars Comb.
Angelika Hellwig, Lutz Volkmann
2004 J jnl
Note on the connectivity of line graphs.
Inf. Process. Lett.
Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann
2004 J jnl
Sufficient conditions for lambda'-optimality in graphs of diameter 2.
Discret. Math.
Angelika Hellwig, Lutz Volkmann
2003 J jnl
Maximally edge-connected digraphs.
Australas. J Comb.
Angelika Hellwig, Lutz Volkmann