Disjoint sub(di)graphs in digraphs
From MaRDI portal
Publication:2851460
DOI10.1016/j.endm.2009.07.030zbMath1273.05083OpenAlexW2001651832MaRDI QIDQ2851460
Matthias Kriesell, Jörgen Bang-Jensen
Publication date: 10 October 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.030
decomposition into strong spanning subdigraphsarc-disjoint branchingsdisjoint directed and undirected paths
Related Items (2)
Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs ⋮ Arc-disjoint spanning sub(di)graphs in digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Decomposing locally semicomplete digraphs into strong spanning subdigraphs
- Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs
- Disjoint directed and undirected paths and cycles in digraphs
- The directed subgraph homeomorphism problem
- Disjoint paths in graphs
- 2-linked graphs
- Highly connected non-2-linked digraphs
- Digraphs
This page was built for publication: Disjoint sub(di)graphs in digraphs