Minimum separators and Menger's theorem

DOI10.1007/S00373-023-02657-5MaRDI QIDQ6115429zbMATH OpenOpenAlexWikidataFDO

Authors Mouhamad El Joubbeh

Publication date 12 July 2023

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-023-02657-5

zbMATH Keywords

connectivityinternally disjoint pathsMenger's theoremminimum separators

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Menger's theorem
• A formal approach to Menger's theorem
• Menger's theorem for matroids
• scientific article; zbMATH DE number 4023311
• A generalization of Menger's theorem for certain unicyclic graphs

Cites work

• A new proof of menger's theorem
• A proof of Menger's theorem
• A proof of Menger's Theorem by contraction
• A simple proof of Menger's theorem
• scientific article; zbMATH DE number 1025912 (Why is no real title available?)
• Maximal Flow Through a Network
• Menger's theorem
• Short proof of Menger's graph theorem
• Short proof of Menger's theorem

Cited in

(8)

• A generalization of Menger's theorem for certain unicyclic graphs
• A generalization of Menger's theorem for certain block-cactus graphs
• Graph-like continua, augmenting arcs, and Menger's theorem
• Some operations on Menger graphs
• Menger's theorem
• MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS
• A formal approach to Menger's theorem
• Menger's theorem for matroids

This page was built for publication: Minimum separators and Menger's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6115429)