Menger's Theorem

DOI10.1002/jgt.1001zbMath0988.05057OpenAlexW4248989993MaRDI QIDQ2725048

Frank Göring, Thomas Böhme, Jochen Harant

Publication date: 22 July 2002

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.1001

zbMATH Keywords

Menger's theorem for digraphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (10)

On short cycles through prescribed vertices of a graph ⋮ On paths and cycles through specified vertices ⋮ Graph-like continua, augmenting arcs, and Menger's theorem ⋮ On a cycle through a specified linear forest of a graph ⋮ Defining binary phylogenetic trees using parsimony: new bounds ⋮ Minimum separators and Menger's theorem ⋮ Rooted minors and locally spanning subgraphs ⋮ Prescribed edges and forbidden edges for a cycle in a planar graph ⋮ On cycles through specified vertices ⋮ A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs

Cites Work

• A simple proof of Menger's theorem

This page was built for publication: Menger's Theorem