Cycle Traversability for Claw-free Graphs and Polyhedral Maps

Ervin Győri, Michael D. Plummer, Dong Ye +1

Let $G$ be a graph, and $v\in V(G)$ and $S\subseteq V(G)\backslash v$ of size at least $k$. An important result on graph connectivity due to Perfect states that, if $v$ and $S$ are…