Cycle Extensibility of [4,2]-graphs
Chunfang Liu · Science Technology and Engineering · 2010
A graph G is called [s,t]-graph,if there are at lesdt t edges in every included subgraphs by s vertices of G.The following result was showed:if G is connected,locally connected [4,2]-graphs with order at least 3,G is fully cycle extendable or is isomorphic to K2∨K3.