Dynamic Chromatic Number of Bipartite Graphs
A dynamic coloring of a graph G is a proper vertex coloring such that for every vertex v Î V(G) of degree at least 2, the neighbors of v receive at least 2 colors. The smallest integer k such that G has a dynamic coloring with k colors, is called the dynamic chromatic number of G and denoted by c2(G...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Alexandru Ioan Cuza University of Iasi
2016-12-01
|
| Series: | Scientific Annals of Computer Science |
| Online Access: | http://www.info.uaic.ro/bin/download/Annals/XXVI2/XXVI2_3.pdf |