A remark on the number of vertices of degree \(k\) in a minimally \(k\)-edge- connected graph
From MaRDI portal
Publication:1198506
DOI10.1016/0012-365X(92)90445-LzbMath0759.05058OpenAlexW1972878733MaRDI QIDQ1198506
Publication date: 16 January 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(92)90445-l
Related Items
Design of computer network topologies: a Vroom inspired psychoclonal algorithm, On Vertices of Degree n in Minimally n-Edge-Connected Graphs
Cites Work