Angelika Hellwig Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2008
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAngelika Hellwig, Lutz Volkmann: The connectivity of a graph and its complement. Discrete Applied Mathematics 156(17): 3325-3328 (2008)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAngelika Hellwig, Lutz Volkmann: Maximally edge-connected and vertex-connected graphs and digraphs: A survey. Discrete Mathematics 308(15): 3265-3296 (2008)
2007
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Angelika Hellwig, Lutz Volkmann: On the connectivity of diamond-free graphs. Discrete Applied Mathematics 155(16): 2111-2117 (2007)
2006
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAngelika Hellwig, Lutz Volkmann: Lower bounds on the vertex-connectivity of digraphs and graphs. Inf. Process. Lett. 99(2): 41-46 (2006)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAngelika Hellwig, Lutz Volkmann: On connectivity in graphs with given clique number. Journal of Graph Theory 52(1): 7-14 (2006)
2005
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAngelika Hellwig, Dieter Rautenbach, Lutz Volkmann: Cuts leaving components of given minimum order. Discrete Mathematics 292(1-3): 55-65 (2005)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJun-Ming Xu, Min Lü, Meijie Ma, Angelika Hellwig: Super connectivity of line graphs. Inf. Process. Lett. 94(4): 191-195 (2005)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAngelika 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
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAngelika Hellwig, Lutz Volkmann: Maximally local-edge-connected graphs and digraphs. Ars Comb. 72: (2004)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAngelika Hellwig, Lutz Volkmann: Sufficient conditions for lambda'-optimality in graphs of diameter 2. Discrete Mathematics 283(1-3): 113-120 (2004)
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAngelika Hellwig, Dieter Rautenbach, Lutz Volkmann: Note on the connectivity of line graphs. Inf. Process. Lett. 91(1): 7-10 (2004)

Coauthor Index

1Peter Dankelmann [9]
2Min Lü [5]
3Meijie Ma [5]
4Dieter Rautenbach [1] [6]
5Lutz Volkmann [1] [2] [3] [4] [6] [7] [8] [9] [10] [11]
6Jun-Ming Xu [5]

Colors in the list of coauthors

Copyright © Fri Dec 4 16:04:45 2009 by Michael Ley (ley@uni-trier.de)