On the cyclability of some cube graphs
Zhiquan Hu · Journal of Central China Normal University · 2006
A graph G is said to be cyclable if for each orientation D of G,there exists a set S(D) V(G) such that reversing all the arcs with one end in S results in a Hamilton digraph.Klostermeyer and Soltes have proved that P43k(k≥1) is not cyclable.It shows that for any integer n≥3,P3nis a cyclable graph if and only if n is odd.