On line disjoint paths of bounded length

DOI10.1016/0012-365X(83)90197-8zbMath0507.05041MaRDI QIDQ1837207

Geoffrey Exoo

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

edge connectivityMenger's theorempaths of bounded length

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Related Items (5)

Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation ⋮ Fault diameter of interconnection networks ⋮ Unnamed Item ⋮ Paths of bounded length and their cuts: parameterized complexity and algorithms ⋮ Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms

Cites Work

• Unnamed Item
• Mengerian theorems for paths of bounded length
• A counterexample to a conjecture on paths of bounded length

This page was built for publication: On line disjoint paths of bounded length