A mixed version of Menger's theorem
From MaRDI portal
Publication:1180411
DOI10.1007/BF01375475zbMath0759.05059OpenAlexW2026063750MaRDI QIDQ1180411
Yoshimi Egawa, Atsushi Kaneko, Makoto Matsumoto
Publication date: 27 June 1992
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01375475
Related Items (6)
Sparse connectivity certificates via MA orderings in graphs ⋮ The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants ⋮ The \(p\)-restricted edge-connectivity of Kneser graphs ⋮ Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs ⋮ Mixed connectivity properties of random graphs and some special graphs ⋮ On minimally \((n,\lambda)\)-connected graphs
Cites Work
This page was built for publication: A mixed version of Menger's theorem
