Disjoint paths in acyclic digraphs

DOI10.1006/JCTB.1993.1018MaRDI QIDQ1325242zbMATH OpenOpenAlexFDO

Authors Alice Metzlar

Publication date 24 May 1994

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jctb.1993.1018

zbMATH Keywords

acyclic digraphcross-linkagedirected pathsplanar representationupper boundary

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Recommendations

• Disjoint Paths in a Planar Graph—A General Theorem
• Disjoint A-paths in digraphs
• scientific article; zbMATH DE number 1409242
• The 2-linkage problem for acyclic digraphs

Cited in

(12)

• Disjoint paths in symmetric digraphs
• Disjoint directed and undirected paths and cycles in digraphs
• The 2-linkage problem for acyclic digraphs
• Independent branchings in acyclic digraphs
• Disjoint non-balanced A-paths in biased graphs
• On the problem of finding disjoint cycles and dicycles in a digraph
• Disjoint A-paths in digraphs
• Disjoint dijoins
• Arc-disjoint paths in decomposable digraphs
• On mergings in acyclic directed graphs
• Algorithms for junctions in acyclic digraphs
• Thomassen's theorem on the two-linkage problem in acyclic digraphs: a shorter proof

This page was built for publication: Disjoint paths in acyclic digraphs

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