Strong subgraph k‐connectivity
From MaRDI portal
Publication:5241602
DOI10.1002/jgt.22437zbMath1425.05085arXiv1803.00284OpenAlexW2963611861MaRDI QIDQ5241602
No author found.
Publication date: 31 October 2019
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.00284
digraphsgeneralized \(k\)-connectivitysymmetric digraphssemicomplete digraphsstrong subgraph \(k\)-connectivitydirected \(k\)-linkage
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (6)
Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs ⋮ Directed Steiner tree packing and directed tree connectivity ⋮ Packing strong subgraph in digraphs ⋮ Cycle-connected mixed graphs and related problems ⋮ Strong subgraph connectivity of digraphs ⋮ Extremal results for directed tree connectivity
This page was built for publication: Strong subgraph k‐connectivity
