On the dominated chromatic number of certain graphs
Let $G$ be a simple graph. The dominated coloring of $G$ is a proper coloring of $G$ such that each color class is dominated by at least one vertex. The minimum number of colors needed for a dominated coloring of $G$ is called the dominated chromatic number of $G$, denoted by $\chi_{dom}(G)$...
Wedi'i Gadw mewn:
| Prif Awduron: | , |
|---|---|
| Fformat: | Artigo |
| Iaith: | Inglês |
| Cyhoeddwyd: |
University of Isfahan
2020-12-01
|
| Cyfres: | Transactions on Combinatorics |
| Pynciau: | |
| Mynediad Ar-lein: | https://toc.ui.ac.ir/article_24862_7ee6f29ca5ca8795e3a390c8fe8145c4.pdf |
| Tagiau: |
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|