No abstract

No abstract

Let G be a 2-connected graph on n vertices and let X C__ V(G). We say that G is X-cyclable if G has an X-cycle, i.e., a cycle containing all vertices of X. We denote by ~(X) the maximum number of pairwise nonadjacent vertices in the subgraph G[X] of G induced by X. If G[X] is not complete, we denote by ~(X) the minimum cardinality of a set of vertices of G separating two vertices of X. By 6(X) we denote the minimum degree (in G) of the vertices of X, and by a3(X) the minimum value of the degree sum (in G) of any three pairwise nonadjacent vertices of X. Our first main result is the following extension in terms of X-cyclability of a result on hamiltonian graphs by Bauer et al. If a3(X)~>n + min{x(X),f(X)}, then G is X-cyclable. Our second main result is the following generalization of a result of Fournier. If ~(X)~< K(X), then G is X-cyclable. We give a number of extensions of other known results, thereby generalizing some recent results of Veldman.

No abstract

No abstract