High connectivity keeping sets in \(n\)-connected graphs

DOI10.1007/S00493-004-0027-6zbMath1056.05089OpenAlexW2077085009MaRDI QIDQ705749

W. Mader

Publication date: 14 February 2005

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-004-0027-6

zbMATH Keywords

connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (4)

On \(k\)-con-critically \(n\)-connected graphs ⋮ Connectivity keeping paths in k-connected graphs ⋮ A connected subgraph maintaining high connectivity ⋮ High connectivity keeping sets in graphs and digraphs

This page was built for publication: High connectivity keeping sets in \(n\)-connected graphs