On the mixed connectivity conjecture of Beineke and Harary

DOI10.1007/s10479-023-05527-8zbMATH Open1544.05056MaRDI QIDQ6596954

Sebastian S. Johann, Manuel Streicher, S. O. Krumke

Publication date: 3 September 2024

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

graph theoryMengermixed connectivitymixed cut

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Menger's theorem for infinite graphs
• A mixed version of Menger's theorem
• A partial k-arboretum of graphs with bounded treewidth
• The condition of Beineke and Harary on edge-disjoint paths some of which are openly disjoint
• The complexity of mixed-connectivity
• Mixed connectivity of Cartesian graph products and bundles
• A Direct Connection Approach to Integrated Line Planning and Passenger Routing
• The connectivity function of a graph
• Retracted article: ``On the survivable network design problem with mixed connectivity requirements

This page was built for publication: On the mixed connectivity conjecture of Beineke and Harary