Outerplanar and planar oriented cliques

Ayan Nandy, Sagnik Sen, Eric Sopena

The clique number of an undirected graph $G$ is the maximum order of a complete subgraph of $G$ and is a well-known lower bound for the chromatic number of $G$. Every proper $k$-co…