A degree sum condition for the existence of a contractible edge in a κ-connected graph

Journal of Combinatorial Theory. Series B

Volumn 82, Issue 1, 2001, Pages 81-101

  Kriesell, Matthias ^a  

^a LEIBNIZ UNIVERSITY HANNOVER   (Germany)

Author keywords

Connectivity; contractible edge; reduction; degree condition; degree sum condition; average degree; distance

Indexed keywords

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

References (9)

1. Bondy J. A., Murty U. S. R. Graph Theory with Applications. 1976;MacMillan, New York.
2. Diestel R. Graph Theory. Graduate Texts in Mathematics. 173:1997;Springer, Berlin/New York.
3. Egawa Y. Contractible edges in n-connected graphs with minimum degree greater than or equal to [5n/4]. Graphs Combin. 7:1991;15-21.
4. Kriesell M. Criticity Results Concerning the Connectivity of Graphs. 1997.
5. Kriesell M. Contractible non-edges in 3-connected graphs. J. Combin. Theory Ser. B. 74:1998;192-201.
6. Kriesell M. Contractible non-edges in triangle free graphs. Graphs Combin. 15:1999;429-439.
7. Mader W. Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen. Europ. J. Combin. 6:1985;353-359.
8. Mader W. Generalizations of critical connectivity of graphs. Discrete Math. 72:1988;267-283.
9. Nebeský L. On induced subgraphs of a block. J. Graph Theory. 1:1977;69-74.