Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices

Matthias Kriesell. Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices. Journal of Combinatorial Theory, Series A, 83(2):305-319, 2001. [doi]

Abstract

Abstract is missing.