Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs

DOI10.1002/jgt.23072arXiv2302.06177OpenAlexW4390543343MaRDI QIDQ6201032

Jörgen Bang-Jensen, Unnamed Author

Publication date: 25 March 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

polynomial algorithmsemicomplete digrapharc-disjoint subdigraphsout-branchingsin-branchings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs
• A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph
• Edge-disjoint in- and out-branchings in tournaments and related path problems
• On two minimax theorems in graph
• Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs
• Small degree out‐branchings
• Quasi‐transitive digraphs
• Arc‐disjoint strong spanning subdigraphs of semicomplete compositions
• Digraphs
• Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2

This page was built for publication: Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs