Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/309016 
Year of Publication: 
2023
Citation: 
[Journal:] Annals of Operations Research [ISSN:] 1572-9338 [Volume:] 332 [Issue:] 1 [Publisher:] Springer US [Place:] New York, NY [Year:] 2023 [Pages:] 107-124
Publisher: 
Springer US, New York, NY
Abstract: 
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 this paper we prove this conjecture for  l=2and every k∈N.We utilize this result to prove that the conjecture holds for all graphs of treewidth at most 3 and all k and l .
Subjects: 
Mixed connectivity
Mixed cut
Menger
Graph theory
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Document Version: 
Published Version

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.