The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices
From MaRDI portal
Publication:1173631
DOI10.1016/0012-365X(90)90161-AzbMath0749.05041OpenAlexW2024152022MaRDI QIDQ1173631
Publication date: 25 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(90)90161-a
Related Items (1)
Cites Work
This page was built for publication: The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices