Smallest number of vertices in a 2-arc-strong digraph without good pairs

DOI10.1016/j.tcs.2022.09.024OpenAlexW4297497393MaRDI QIDQ2087467

Yongtang Shi, Zhenyu Taoqiu, Shasha Li, Gregory Gutin, Ran Gu

Publication date: 21 October 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.09.024

zbMATH Keywords

out-branchingarc-connectivityarc-disjoint branchingsin-branching

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Parameterized algorithms for non-separating trees and branchings in digraphs
• Decomposing locally semicomplete digraphs into strong spanning subdigraphs
• Edge-disjoint in- and out-branchings in tournaments and related path problems
• On two minimax theorems in graph
• \(k\)-distinct in- and out-branchings in digraphs
• Classes of Directed Graphs
• Arc‐disjoint strong spanning subdigraphs of semicomplete compositions
• Digraphs
• Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2