Name
Abstract | ||
|---|---|---|
A dynamic colouring of a graph is a proper colouring in which no neighbourhood of a non-leaf vertex is monochromatic. The dynamic colouring number
χ2(G) of a graph G is the least number of colours needed for a dynamic colouring of G. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.dam.2017.05.004 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Graph colouring,Dynamic colouring | Integer,Discrete mathematics,Graph,Combinatorics,Bound graph,Vertex (geometry),Upper and lower bounds,Regular graph,Counterexample,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
229 | C | 0166-218X |
Citations | PageRank | References |
1 | 0.36 | 9 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nathan Bowler | 1 | 16 | 6.83 |
| Joshua Erde | 2 | 4 | 4.93 |
| Florian Lehner | 3 | 21 | 7.24 |
| Martin Merker | 4 | 18 | 3.67 |
| Max Pitz | 5 | 1 | 4.75 |
| Konstantinos Stavropoulos | 6 | 1 | 0.36 |