Tight upper bound on the clique size in the square of 2-degenerate graphs

Seog-Jin Kim, Xiaopan Lian

The {\em square} of a graph $G$, denoted $G^2$, has the same vertex set as $G$ and has an edge between two vertices if the distance between them in $G$ is at most $2$. In general,…