Publication Date

February 2022


A (not necessarily proper) $k$-coloring $c : V(G) \rightarrow \{1,2,\dots,k\}$ of a graph $G$ on a surface is a {\em facial $t$-complete $k$-coloring} if every $t$-tuple of colors appears on the boundary of some face of $G$. The maximum number $k$ such that $G$ has a facial $t$-complete $k$-coloring is called a {\em facial $t$-achromatic number} of $G$, denoted by $\psi_t(G)$. In this paper, we investigate the relation between the facial 3-achromatic number and guarding number of triangulations on a surface, where a {\em guarding number} of a graph $G$ embedded on a surface, denoted by $\gd(G)$, is the smallest size of its {\em guarding set} which is a generalized concept of guards in the art gallery problem. We show that for any graph $G$ embedded on a surface, $\psi_{\Delta(G^*)}(G) \leq \gd(G) + \Delta(G^*) - 1$, where $\Delta(G^*)$ is the largest face size of $G$. Furthermore, we investigate sufficient conditions for a triangulation $G$ on a surface to satisfy $\psi_{3}(G) = \gd(G) + 2$. In particular, we prove that every triangulation $G$ on the sphere with $\gd(G) = 2$ satisfies the above equality and that for one with guarding number $3$, it also satisfies the above equality with sufficiently large number of vertices.

Creative Commons License

Creative Commons Attribution 4.0 License
This work is licensed under a Creative Commons Attribution 4.0 License.

ref_tag2022090101.pdf (166 kB)
Supplemental Reference List with DOIs