On incidence coloring conjecture in Cartesian products of graphs

Petr Gregor, Borut Lužar, Roman Soták

An incidence in a graph $G$ is a pair $(v,e)$ where $v$ is a vertex of $G$ and $e$ is an edge of $G$ incident to $v$. Two incidences $(v,e)$ and $(u,f)$ are adjacent if at least on…