Compelling Colorings: A generalization of the dominator chromatic number

DOI10.1016/J.AMC.2022.127193arXiv2105.03694MaRDI QIDQ6367162FDOQ6367162

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

Publication date: 8 May 2021

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.

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Compelling Colorings: A generalization of the dominator chromatic number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6367162)