Facial Achromatic Number of Triangulations with Given Guarding Number
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...
| Published in: | Theory and Applications of Graphs |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Georgia Southern University
2022-02-01
|
| Subjects: | |
| Online Access: | https://digitalcommons.georgiasouthern.edu/tag/vol9/iss1/1 |