Name
Abstract | ||
|---|---|---|
A (k, r)-coloring of a graph G is a proper k-vertex coloring of G such that the neighbors of each vertex of degree d will receive at least min{d, r} different colors. The r-hued chromatic number, denoted by chi(r) (G), is the smallest integer k for which a graph G has a (k, r)-coloring. This article is intended to survey the recent developments on the studies related to this r-hued colorings. Emphases are on the r-hued colorings of planar graphs, graph families with forbidden minors, and sparse graphs, as well as on the comparison between the r-hued chromatic number and the chromatic number of a graph, and the sensitivity studies of the r-hued chromatic number. It also surveys other related results on r-hued colorings and list r-hued colorings. (C) 2022 Elsevier B.V. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.dam.2022.06.003 | DISCRETE APPLIED MATHEMATICS |
Keywords | DocType | Volume |
r-hued chromatic number, List r-hued chromatic number, Distance colorings | Journal | 321 |
ISSN | Citations | PageRank |
0166-218X | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ye Chen | 1 | 0 | 0.68 |
| Suohai Fan | 2 | 0 | 0.34 |
| Hong-Jian Lai | 3 | 631 | 97.39 |
| Murong Xu | 4 | 0 | 0.34 |