A Note on the Complexity of Directed Clique

Grzegorz Gutowski, Mikołaj Rams

For a directed graph $G$, and a linear order $\ll$ on the vertices of $G$, we define backedge graph $G^{\ll }$ to be the undirected graph on the same vertex set with edge $\{u,w\}$ in…