Arc-disjoint out- and in-branchings in compositions of digraphs
From MaRDI portal
Publication:6568855
DOI10.1016/j.ejc.2024.103981MaRDI QIDQ6568855
Jørgen Bang-Jensen, Unnamed Author
Publication date: 8 July 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- 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
- Generalizations of tournaments: A survey
- 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
- Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs
- Unnamed Item
Related Items (1)
This page was built for publication: Arc-disjoint out- and in-branchings in compositions of digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568855)
