The following pages link to Angelika Hellwig (Q845668):
Displaying 17 items.
- Lower bounds on the vertex-connectivity of digraphs and graphs (Q845669) (← links)
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey (Q932603) (← links)
- The connectivity of a graph and its complement (Q1003479) (← links)
- Super connectivity of line graphs (Q1041748) (← links)
- Inverse degree and edge-connectivity (Q1043655) (← links)
- Cuts leaving components of given minimum order (Q1773356) (← links)
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2 (Q1827779) (← links)
- Neighborhood and degree conditions for super-edge-connected bipartite digraphs (Q1885228) (← links)
- On the connectivity of diamond-free graphs (Q2384395) (← links)
- Note on the connectivity of line graphs (Q2390273) (← links)
- (Q3423983) (← links)
- (Q4405634) (← links)
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected (Q4667802) (← links)
- (Q5463503) (← links)
- On connectivity in graphs with given clique number (Q5471054) (← links)
- (Q5702647) (← links)
- (Q5709006) (← links)
