Extremal results for directed tree connectivity

DOI10.1007/s40840-021-01237-1zbMath1485.05028arXiv2012.06698OpenAlexW4205348704MaRDI QIDQ2117576

Yanyan Li

Publication date: 21 March 2022

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.06698

zbMATH Keywords

out-branchingout-treedirected Steiner tree packingdirected tree connectivitygeneralized \(k\)-arc-strong connectivitygeneralized \(k\)-vertex-strong connectivity

Mathematics Subject Classification ID

Trees (05C05) 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

• Tree connectivities of Cayley graphs on abelian groups with small degrees
• Pendant tree-connectivity
• Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)
• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• Note on Halin's theorem on minimally connected graphs
• Strong subgraph connectivity of digraphs
• Hardness and approximation results for packing Steiner trees
• On the generalized (edge-)connectivity of graphs
• Generalized Connectivity of Graphs
• On Vertices of outdegree n in minimally n‐connected digraphs
• Strong subgraph k‐connectivity
• Digraphs
• A theorem on n-connected graphs

This page was built for publication: Extremal results for directed tree connectivity