An Ore-type condition for cyclability
A graph \(G\) is said to be cyclable if for each orientation \(D\) of \(G\), there is a set \(S(D)\subseteq V(G)\) such that reversing all arcs with one end in \(S(D)\) results in a Hamiltonian digraph. The authors show that if \(G\) is a simple graph of even order \(n\geq 8\), such that for each pair of non-adjacent vertices \(u,v\in V(G)\), \(d_G(u)+ d_G(v)\geq n+1\), then \(G\) is cyclable. The result is shown to be best possible as \(K_{2t+ 1,2t+1}\) is not cyclable for all \(t\geq 1\).
scientific article; zbMATH DE number 1672641