Backward Arcs in Hamilton Oriented Cycles and Paths in Directed Graphs with Independence Number Two

S. Gerke, Q. Guo, G. Gutin +3

In a digraph $D=(V,A)$, an oriented path is a sequence $P=x_1{x}_2\dots x_p$ of distinct vertices such that either $x_i{x}_{i+1}\in A$ or $x_{i+1}{x}_i\in A$ or both for every $i\in [p…