High Connectivity Keeping Sets In n-Connected Graphs

It is proved that for every positive integer k, every n-connected graph G of sufficiently large order contains a set W of k vertices such that GW is (n-2)-connected. It is shown that this does not remain true if we add the condition that G(W) is connected.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Corresponding author

Correspondence to W. Mader.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Mader, W. High Connectivity Keeping Sets In n-Connected Graphs. Combinatorica 24, 441–458 (2004). https://doi.org/10.1007/s00493-004-0027-6

Download citation

Mathematics Subject Classification (2000):

  • 05C40
  • 05C35