A generalized neighobrhood union condition for pancyclicity

摘要

Let G be a 2-connected simple graph with order N(n≥6) and minimum de- gree δ. This paper proves that if for any independent set of three vertices {u,u,w}≤ V(G) there always exist x and y∈ {u, u,w} such that |N (x) UN(y)| ≥n-δ+1, then G is pancyclic.