On k-con-critically n-connected graphs

Journal of Combinatorial Theory. Series B

Volumn 86, Issue 2, 2002, Pages 296-314

  Mader, W ^a  

^a LEIBNIZ UNIVERSITY HANNOVER   (Germany)

Author keywords

Critical connectivity; Vulnerability of networks

Indexed keywords

EID: 0036847612     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2002.2129     Document Type: Article

References (7)

1. R. Diestel, "Graph Theory," Graduate Texts in Mathematics, Vol. 173, Springer-Verlag, New York/Berlin, 1997.
2. M. Kriesell, "Über verschiedene Klassen kritisch zusammenhängender Graphen," Diploma Thesis, Universität Hannover, 1993.
3. M. Kriesell, Contractible subgraphs in 3-connected graphs, J. Combin. Theory (B) 80 (2000), 32-48.
4. W. Mader, Endlichkeitssätze für k-kritische Graphen, Math. Ann. 229 (1977), 143-153.
5. W. Mader, On k-critically n-connected graphs, in "Progress in Graph Theory" (J.A. Bondy and U.S.R. Murty, Eds.), pp. 389-398, Academic Press, New York, 1984.
6. W. Mader, High connectivity keeping sets in n-connected graphs, Combinatorica, to appear.
7. W. McCuaig and K. Ota, Contractible triples in 3-connected graphs, J. Combin. Theory (B) 60 (1994), 308-314.