A sufficient condition of a pancyclicity [s,t]-graph
Xiaoyan Liu · Journal of Shandong University · 2008
A graph G is called an [s,t]-graph,if there are at least t edges in every induced subgraph of s vertices.Let G be a 2-connected [4,2]-graph and the order of G be not less than 7,then G is a pancyclicity graph.