A fan-type condition for cyclability (Q2581424)

A graph \(G\) is said to be cyclable if for each orientation of \(G\) there exists a set of vertices such that reversing all the arcs with one end of the vertices results in a Hamiltonian digraph. The authors give a sufficient condition in which a 4-connected graph is cyclable.