Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs

DOI10.7151/dmgt.2301zbMath1492.05058OpenAlexW3006396600MaRDI QIDQ2151209

Yanyan Li

Publication date: 1 July 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2301

zbMATH Keywords

strong subgraph \(k\)-arc-connectivitystrong subgraph \(k\)-connectivitysubdigraph packing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Cites Work

• Unnamed Item
• Decomposing locally semicomplete digraphs into strong spanning subdigraphs
• Arc-disjoint spanning sub(di)graphs in digraphs
• Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs
• Pendant tree-connectivity
• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• Strong subgraph connectivity of digraphs
• Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs
• Hardness and approximation results for packing Steiner trees
• Disjoint sub(di)graphs in digraphs
• On the generalized (edge-)connectivity of graphs
• Generalized Connectivity of Graphs
• Strong subgraph k‐connectivity
• Digraphs

This page was built for publication: Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs