Cyclability, Connectivity and Circumference

Niranjan Balachandran, Anish Hebbar

In a graph $G$, a subset of vertices $S\subseteq V(G)$ is said to be cyclable if there is a cycle containing the vertices in some order. $G$ is said to be $k$-cyclable if any subs…