Abstract: A graph G is a ［s,t］-graph if at least t edges exist in its every included subgraph with s vertices. We prove that every connected and locally 2-connected ［4,1］-graph is fully cycle extendable.

Key words: ［s,t］-graph, cycle extendable, locally k-connected