High connectivity keeping sets in graphs and digraphs

We survey results and possible results of the following type: given positive integers n,k,d, is there an integer h"d(n,k) so that every n-connected, finite graph (digraph) G of order at least h"d(n,k) contains a set W of exactly k vertices so that G-W is (n-d)-connected? For digraphs, these question have not really been studied before, so almost all problems are open.

[1]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[2]  Matthias Kriesell.  Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices , 2001, J. Comb. Theory, Ser. B.

[3]  J. A. Bondy,et al.  Progress in Graph Theory , 1984 .

[4]  William T. Tutte,et al.  A theory of 3-connected graphs , 1961 .

[5]  Wolfgang Mader,et al.  Minimal n-fach zusammenhängende Digraphen , 1985, J. Comb. Theory, Ser. B.

[6]  Peter J. Slater,et al.  On k-critical, n-connected graphs , 1977, Discret. Math..

[7]  W. Mader.  Ecken vom Gradn in minimalenn-fach zusammenhängenden Graphen , 1972 .

[8]  Matthias Kriesell.  The k-Critical 2k-Connected Graphs for kepsilon{3, 4} , 2000, J. Comb. Theory, Ser. B.

[9]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

[10]  Carsten Thomassen,et al.  Kuratowski's theorem , 1981, J. Graph Theory.

[11]  Saharon Shelah,et al.  Large k-preserving sets in infinite graphs , 1994, J. Graph Theory.

[12]  Wolfgang Mader.  High Connectivity Keeping Sets In n-Connected Graphs , 2004, Comb..

[13]  Wolfgang Mader.  On k-con-Critically n-Connected Graphs , 2002, J. Comb. Theory, Ser. B.

[14]  E. A. vanDoorn.  Connectivity of circulant digraphs , 1983 .

[15]  Wolfgang Mader,et al.  Ecken von kleinem Grad in kritisch n-fach zusammenhängenden Digraphen , 1991, J. Comb. Theory, Ser. B.

[16]  W. Mader,et al.  Endlichkeitssätze fürk-kritische Graphen , 1977 .

[17]  Wolfgang Mader.  Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen , 1985, Eur. J. Comb..

[18]  Wolfgang Mader.  On critically connected digraphs , 1989, J. Graph Theory.

[19]  On Infinite n-Connected Graphs , 1990 .

[20]  Robert E. Woodrow,et al.  Cycles and rays , 1990 .

[21]  Nicola Martinov.  A recursive characterization of the 4-connected graphs , 1990, Discret. Math..

[22]  Katsuhiro Ota,et al.  Contractile Triples in 3-Connected Graphs , 1994, J. Comb. Theory, Ser. B.

[23]  R. Halin.  Zur Theorie dern-fach zusammenhängenden Graphen , 1969 .

[24]  Tibor Jordán.  On the existence of (k, l)-critical graphs , 1998, Discret. Math..

[25]  Wolfgang Mader,et al.  On Vertices of outdegree n in minimally n‐connected digraphs , 2002, J. Graph Theory.

[26]  H. Ryser.  Combinatorial Mathematics: THE PRINCIPLE OF INCLUSION AND EXCLUSION , 1963 .

[27]  Nicola Martinov.  Uncontractable 4-connected graphs , 1982, J. Graph Theory.

[28]  Jianji Su.  On locally k-critically n-connected graphs , 1993, Discret. Math..

[29]  Matthias Kriesell,et al.  Contractible Subgraphs in 3-Connected Graphs , 2000, J. Comb. Theory, Ser. B.

[30]  Matthias Kriesell.  Mader’s Conjecture On Extremely Critical Graphs , 2006, Comb..

[31]  Jian Ji Su.  Fragments in 2-Critically n-Connected Graphs , 1993, J. Comb. Theory, Ser. B.

[32]  W. Mader.  Eine Eigenschaft der Atome endlicher Graphen , 1971 .

[33]  Wolfgang Mader,et al.  Generalizations of critical connectivity of graphs , 1988, Discret. Math..