| 2008 |
|---|
| 11 | EE | Angelika Hellwig,
Lutz Volkmann:
The connectivity of a graph and its complement.
Discrete Applied Mathematics 156(17): 3325-3328 (2008) |
| 10 | EE | Angelika Hellwig,
Lutz Volkmann:
Maximally edge-connected and vertex-connected graphs and digraphs: A survey.
Discrete Mathematics 308(15): 3265-3296 (2008) |
| 2007 |
|---|
| 9 | EE | Peter Dankelmann,
Angelika Hellwig,
Lutz Volkmann:
On the connectivity of diamond-free graphs.
Discrete Applied Mathematics 155(16): 2111-2117 (2007) |
| 2006 |
|---|
| 8 | EE | Angelika Hellwig,
Lutz Volkmann:
Lower bounds on the vertex-connectivity of digraphs and graphs.
Inf. Process. Lett. 99(2): 41-46 (2006) |
| 7 | EE | Angelika Hellwig,
Lutz Volkmann:
On connectivity in graphs with given clique number.
Journal of Graph Theory 52(1): 7-14 (2006) |
| 2005 |
|---|
| 6 | EE | Angelika Hellwig,
Dieter Rautenbach,
Lutz Volkmann:
Cuts leaving components of given minimum order.
Discrete Mathematics 292(1-3): 55-65 (2005) |
| 5 | EE | Jun-Ming Xu,
Min Lü,
Meijie Ma,
Angelika Hellwig:
Super connectivity of line graphs.
Inf. Process. Lett. 94(4): 191-195 (2005) |
| 4 | EE | Angelika Hellwig,
Lutz Volkmann:
Sufficient conditions for graphs to be lambda'-optimal, super-edge-connected, and maximally edge-connected.
Journal of Graph Theory 48(3): 228-246 (2005) |
| 2004 |
|---|
| 3 | | Angelika Hellwig,
Lutz Volkmann:
Maximally local-edge-connected graphs and digraphs.
Ars Comb. 72: (2004) |
| 2 | EE | Angelika Hellwig,
Lutz Volkmann:
Sufficient conditions for lambda'-optimality in graphs of diameter 2.
Discrete Mathematics 283(1-3): 113-120 (2004) |
| 1 | EE | Angelika Hellwig,
Dieter Rautenbach,
Lutz Volkmann:
Note on the connectivity of line graphs.
Inf. Process. Lett. 91(1): 7-10 (2004) |
