Johann, Sebastian S.; Krumke, Sven O.; Streicher, Manuel - In: Annals of Operations Research 332 (2023) 1, pp. 107-124
The conjecture of Beineke and Harary states that for any two vertices which can be separated by k vertices and l edges for l≥1but neither by k vertices and l-1edges nor k-1vertices and l edges there are k+ledge-disjoint paths connecting these two vertices of which k+1are internally disjoint.In...