A fan-type condition for cyclability Original Research Article

A graph G is said to be cyclable if for each orientation D of G, there exists a set image such that reversing all the arcs with one end in S results in a hamiltonian digraph. Let G be 4-connected simple graph of even order image. In this paper, we show that if image for any image with image, then G is cyclable.