An existence criterion for a cycle such that the vertex set beyond this cycle is independent
arXiv:2203.13549
Abstract
We prove that if is a 2-connected graph with then has a cycle such that is independent. This result is best possible in the sense that it becomes false if is replaced by any smaller number.