BibTeX
CSL-JSON
MLA
Harvard
Compelling Colorings: A generalization of the dominator chromatic number
release_umvadvovwnga5pl7kbjxset6se
by
Anna Bachstein, Wayne Goddard, Michael A. Henning, John Xue
Released
as a article
.
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.
In text/plain
format
Archived Files and Locations
application/pdf 323.5 kB
file_e64m2e3d7relpn6kzmccscmjke
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
2105.03694v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links