Role coloring of graphs from rooted products
A k-role coloring is an assignment of k colors to the vertices of a graph such that if any two vertices receive the same color, then the set of colors assigned to their neighborhood will also be the same. Any graph with n vertices can have n-role coloring. Although it is easy to determine whether a...
| Published in: | Прикладная дискретная математика № 68. С. 94-102 |
|---|---|
| Main Author: | |
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Subjects: | |
| Online Access: | https://vital.lib.tsu.ru/vital/access/manager/Repository/koha:001159473 Перейти в каталог НБ ТГУ |