On the complexity of some quorum colorings problems of graphs
A partition of the vertex set V of a graph G into k color classes with is called a quorum coloring if for every vertex at least half of the vertices in the closed neighborhood of v have the same color as v. The maximum order of a quorum coloring of G is called the quorum coloring number of G and is...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-09-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.12.010 |