On uniquely 3-colorable plane graphs without prescribed adjacent faces

Zepeng Li, Naoki Matsumoto, Enqiang Zhu +2

A graph $G$ is \emph{uniquely k-colorable} if the chromatic number of $G$ is $k$ and $G$ has only one $k$-coloring up to permutation of the colors. For a plane graph $G$, two faces…