Strong Subgraph Connectivity of Digraphs: A Survey

From MaRDI portal





Abstract: In this survey we overview known results on the strong subgraph k-connectivity and strong subgraph k-arc-connectivity of digraphs. After an introductory section, the paper is divided into four sections: basic results, algorithms and complexity, sharp bounds for strong subgraph k-(arc-)connectivity, minimally strong subgraph (k,ell)-(arc-) connected digraphs. This survey contains several conjectures and open problems for further study.












This page was built for publication: Strong Subgraph Connectivity of Digraphs: A Survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6305183)