Strong subgraph connectivity of digraphs
From MaRDI portal
Publication:2045390
DOI10.1007/s00373-021-02294-wzbMath1470.05068OpenAlexW3136309245MaRDI QIDQ2045390
Publication date: 12 August 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-021-02294-w
generalized connectivityarc-disjoint subgraph decompositiondirected graph connectivitystrong subgraph arc connectivitystrong subgraph connectivity
Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (4)
Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs ⋮ Directed Steiner tree packing and directed tree connectivity ⋮ Packing strong subgraph in digraphs ⋮ Extremal results for directed tree connectivity
Cites Work
- Decomposing locally semicomplete digraphs into strong spanning subdigraphs
- Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs
- Pendant tree-connectivity
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- Highly connected non-2-linked digraphs
- Edge-disjoint branching in directed multigraphs
- Disjoint paths in unions of tournaments
- A survey of Nordhaus-Gaddum type relations
- Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs
- Generalized Connectivity of Graphs
- Robbins's Theorem for Mixed Multigraphs
- Arc‐disjoint strong spanning subdigraphs of semicomplete compositions
- Strong subgraph k‐connectivity
- Digraphs
- On the spanning tree packing number of a graph: A survey
This page was built for publication: Strong subgraph connectivity of digraphs
