Angelika Hellwig

Available identifiers

Publication	Date of Publication	Type
Lower bounds on the vertex-connectivity of digraphs and graphs	2010-01-29	Paper
Inverse degree and edge-connectivity	2009-12-09	Paper
Super connectivity of line graphs	2009-12-04	Paper
Note on the connectivity of line graphs	2009-07-21	Paper
The connectivity of a graph and its complement	2009-03-04	Paper
Maximally edge-connected and vertex-connected graphs and digraphs: A survey	2008-07-11	Paper
On the connectivity of diamond-free graphs	2007-09-21	Paper
Some upper bounds for the domination number	2007-02-15	Paper
On connectivity in graphs with given clique number	2006-06-06	Paper
https://portal.mardi4nfdi.de/entity/Q5709006	2005-11-21	Paper
https://portal.mardi4nfdi.de/entity/Q5702647	2005-11-02	Paper
https://portal.mardi4nfdi.de/entity/Q5463503	2005-08-04	Paper
Cuts leaving components of given minimum order	2005-04-28	Paper
Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected	2005-04-21	Paper
Neighborhood and degree conditions for super-edge-connected bipartite digraphs	2004-10-28	Paper
Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4405634	2003-09-30	Paper

This page was built for person: Angelika Hellwig