Cycles and paths through specified vertices in k-connected graphs
Let G be a k-connected graph with minimum degree d and at least 2d vertices. Then G has a cycle of length at least 2d through any specified set of k vertices. A similar result for paths is also given.
scientific article; zbMATH DE number 4089588