$L(n)$ graphs are vertex-pancyclic and Hamilton-connected

S. Morteza Mirafzal, Sara Kouhi

A graph $G$ of order $n>2$ is pancyclic if $G$ contains a cycle of length $l$ for each integer $l$ with $3\le l\le n$ and it is called vertex-pancyclic if every vertex is cont…