Compelling colorings: A generalization of the dominator chromatic number

Anna Bachstein, Wayne Goddard, Michael A. Henning and John Xue

Applied Mathematics and Computation, 2022, vol. 428, issue C

Abstract: 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.

Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322002673
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:428:y:2022:i:c:s0096300322002673

DOI: 10.1016/j.amc.2022.127193

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().