Regular ArticleAlmost All 3-Connected Graphs Contain a Contractible Set of k Vertices
Under an Elsevier user license
open archive
Keywords
connectivity
contractable subgraph
reduction
longest induced path
longest cycle
Cited by (0)
Copyright © 2001 Elsevier Science (USA). All rights reserved.