首页|Compelling colorings: A generalization of the dominator chromatic number
Compelling colorings: A generalization of the dominator chromatic number
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
We define a P-compelling coloring as a proper coloring of the vertices of a graph such that every subset consisting of one vertex of each color has property P. The P-compelling chromatic number is the minimum number of colors in such a coloring. We show that this notion generalizes the dominator and total dominator chromatic numbers, and provide some general bounds and algorithmic results. We also investigate the specific cases where P is that the subset contains at least one edge or that the subset is connected. (C) 2022 Elsevier Inc. All rights reserved.
Bachstein, Anna、Goddard, Wayne、Henning, Michael A.、Xue, John
NSTL
Elsevier
