Name
Abstract | ||
|---|---|---|
A proper vertex k-coloring of a graph G is dynamic if for every vertex v with degree at least 2, the neighbors of v receive at least two different colors. The smallest integer k such that G has a dynamic k-coloring is the dynamic chromatic number χd(G). In this paper the differences between χd(G) and χd(G−e), and between χd(G) and χd(G−v) are investigated respectively. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.disc.2016.01.009 | Discrete Mathematics |
Keywords | Field | DocType |
Dynamic coloring,Dynamic chromatic number | Integer,Edge coloring,Discrete mathematics,Complete coloring,Combinatorics,Chromatic scale,Fractional coloring,Vertex (geometry),List coloring,Brooks' theorem,Mathematics | Journal |
Volume | Issue | ISSN |
339 | 5 | 0012-365X |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lianying Miao | 1 | 11 | 2.56 |
| Hong-Jian Lai | 2 | 631 | 97.39 |
| Yan-Fang Guo | 3 | 0 | 0.34 |
| Zhengke Miao | 4 | 66 | 17.62 |