Disjoint sub(di)graphs in digraphs

DOI10.1016/J.ENDM.2009.07.030MaRDI QIDQ2851460zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

arc-disjoint branchingsdecomposition into strong spanning subdigraphsdisjoint directed and undirected paths

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• Arc-disjoint spanning sub(di)graphs in digraphs
• scientific article; zbMATH DE number 842022
• Disjoint A-paths in digraphs
• Disjoint directed cycles
• On digraphs with no two disjoint directed cycles

Cites work

• 2-linked graphs
• Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs
• Decomposing locally semicomplete digraphs into strong spanning subdigraphs
• Digraphs
• Disjoint directed and undirected paths and cycles in digraphs
• Disjoint paths in graphs
• Highly connected non-2-linked digraphs
• scientific article; zbMATH DE number 4164908 (Why is no real title available?)
• The directed subgraph homeomorphism problem
• The wonderful Walecki construction

Cited in

(4)

• Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs
• Connecting Terminals and 2-Disjoint Connected Subgraphs
• Arc-disjoint spanning sub(di)graphs in digraphs
• Approximately packing Dijoins via nowhere-zero flows

This page was built for publication: Disjoint sub(di)graphs in digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851460)