High connectivity keeping sets in graphs and digraphs
Author:
- 21 October 2005
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 302 (1-3) , 173-187
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Almost All 3-Connected Graphs Contain a Contractible Set of k VerticesJournal of Combinatorial Theory, Series B, 2001
- Contractible Subgraphs in 3-Connected GraphsJournal of Combinatorial Theory, Series B, 2000
- The k-Critical 2k-Connected Graphs for k∈{3, 4}Journal of Combinatorial Theory, Series B, 2000
- On the existence of (k, l)-critical graphsDiscrete Mathematics, 1998
- Largek-preserving sets in infinite graphsJournal of Graph Theory, 1994
- Disjunkte Fragmente in kritisch n-fach zusammenhängenden GraphenEuropean Journal of Combinatorics, 1985
- Endlichkeitss tze f rk-kritische GraphenMathematische Annalen, 1977
- Ecken vom Gradn in minimalenn-fach zusammenh ngenden GraphenArchiv der Mathematik, 1972
- Eine Eigenschaft der Atome endlicher GraphenArchiv der Mathematik, 1971
- Zur Theorie dern-fach zusammenhängenden GraphenAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1969