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

DOI10.1002/jgt.3190110309zbMath0652.05021OpenAlexW2039846580MaRDI QIDQ3797196

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

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

Related Items (7)

Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity ⋮ Spanning trees: A survey ⋮ Independent spanning trees with small depths in iterated line digraphs ⋮ Disjoint paths in arborescences ⋮ Independent branchings in acyclic digraphs ⋮ Relay placement for two-connectivity ⋮ Independent trees in graphs

Cites Work

• Min-max Relations for Directed Graphs

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