Vertex-disjoint paths and edge-disjoint branchings in directed graphs

DOI10.1002/JGT.3190110309MaRDI QIDQ3797196zbMATH OpenOpenAlexFDO

Authors R. W. Whitty

Publication date 1987

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

Full work available at URL https://doi.org/10.1002/jgt.3190110309

zbMATH Keywords

branchingvertex-disjoint pathsfinite directed graphbinary graphpredicate function

Mathematics Subject Classification ID

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

Recommendations

• On vertex-disjoint paths in regular graphs
• scientific article; zbMATH DE number 4089593
• Edge-disjoint paths revisited
• scientific article; zbMATH DE number 2079393
• scientific article; zbMATH DE number 2188351
• Edge-disjoint paths and cycles inn-edge-connected graphs
• Disjoint directed and undirected paths and cycles in digraphs
• Disjoint paths in graphs. (Reprint)
• Disjoint \(A\)-paths in digraphs
• Edge-disjoint paths in digraphs with bounded independence number

Cites work

• Min-max Relations for Directed Graphs

Cited in

(10)

• Disjoint paths in arborescences
• Independent spanning trees with small depths in iterated line digraphs
• Disproof of a conjecture about independent branchings in k‐connected directed graphs
• Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity
• Independent branchings in acyclic digraphs
• Relay placement for two-connectivity
• LATIN 2004: Theoretical Informatics
• Independent trees in graphs
• Spanning trees: A survey
• Edmonds' branching theorem in digraphs without forward-infinite paths

This page was built for publication: Vertex-disjoint paths and edge-disjoint branchings in directed graphs

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