Long paths and cycles passing through specified vertices under the average degree condition

Binlong Li, Bo Ning, Shenggui Zhang

Let $G$ be a $k$-connected graph with $k\ge 2$. In this paper we first prove that: For two distinct vertices $x$ and $z$ in $G$, it contains a path passing through its any $k-2$ {…