2000 character limit reached
Strong Subgraph Connectivity of Digraphs: A Survey (1808.02740v1)
Published 8 Aug 2018 in cs.DM and math.CO
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.