We call an oriented odd cycle alternating if it has exactly one vertex whose in-degree and out-degree are both positive. In this paper, we investigate whether certain graphs admit an orientation that avoids alternating odd cycles as subgraphs, or one in which all their shortest odd cycles become alternating. Our focus is on topologically $χ$-chromatic graphs, that is, graphs for which the topological method yields a sharp lower bound on the chromatic number. We present results for several graph families, including Kneser graphs, Schrijver graphs, and generalized Mycielski graphs.