Lower bounds of \(|X|\) and \(|Y|\) of edge-cut \( (X,Y)\) and maximality and superiority of a digraph (Q2917016)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lower bounds of \(|X|\) and \(|Y|\) of edge-cut \( (X,Y)\) and maximality and superiority of a digraph |
scientific article; zbMATH DE number 6091408
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds of \(|X|\) and \(|Y|\) of edge-cut \( (X,Y)\) and maximality and superiority of a digraph |
scientific article; zbMATH DE number 6091408 |
Statements
5 October 2012
0 references
edge-cut
0 references
maximally edge-connected digraph
0 references
super-edge-connected digraph
0 references
super-local-edge-connected digraph
0 references
Lower bounds of \(|X|\) and \(|Y|\) of edge-cut \( (X,Y)\) and maximality and superiority of a digraph (English)
0 references
