Cycles through specified vertices
Abstract
Recently, various authors have obtained results about the existence of long cycles in graphs with a given minimum degree d. We extend these results to the case where only some of the vertices are known to have degree at least d, and we want to find a cycle through as many of these vertices as possible. If G is a graph on n vertices and W is a set of w vertices of degree at least d, we prove that there is a cycle through at least {Mathematical expression} vertices of W. We also find the extremal graphs for this property. © 1993 Akadémiai Kiadò.
Publication Title
Combinatorica
Recommended Citation
Bollobás, B., & Brightwell, G. (1993). Cycles through specified vertices. Combinatorica, 13 (2), 147-155. https://doi.org/10.1007/BF01303200
COinS
