Strong subgraph connectivity of digraphs
type: Item
instance of: scholarly article
title: Strong subgraph connectivity of digraphs
zbMATH Open document ID: 1470.05068
author: Yanyan Li
published in: Graphs and Combinatorics
publication date: 2021-08-12T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 7381422
zbMATH Keywords: directed graph connectivity
zbMATH Keywords: strong subgraph connectivity
zbMATH Keywords: strong subgraph arc connectivity
zbMATH Keywords: generalized connectivity
zbMATH Keywords: arc-disjoint subgraph decomposition
MaRDI profile type: Publication
full work available at URL: s00373-021-02294-w
OpenAlex ID: W3136309245
cites work: A survey of Nordhaus-Gaddum type relations
cites work: Digraphs
cites work: Arc‐disjoint strong spanning subdigraphs of semicomplete compositions
cites work: Decomposing locally semicomplete digraphs into strong spanning subdigraphs
cites work: Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs
cites work: Robbins's Theorem for Mixed Multigraphs
cites work: Disjoint paths in unions of tournaments
cites work: Pendant tree-connectivity
cites work: Generalized Connectivity of Graphs
cites work: On the spanning tree packing number of a graph: A survey
cites work: Edge-disjoint branching in directed multigraphs
cites work: Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs
cites work: Strong subgraph k‐connectivity
cites work: Highly connected non-2-linked digraphs
cites work: A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
DOI: 10.1007/S00373-021-02294-W
description: scientific article; zbMATH DE number 7381422