The game chromatic number of corona of two graphs
In this paper, we compute an upper bound for the game chromatic number of corona of any two simple graphs G and H, denoted by Also, we determine the game chromatic number of and
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | English |
| Publicado em: |
Taylor & Francis Group
2020-09-01
|
| coleção: | AKCE International Journal of Graphs and Combinatorics |
| Assuntos: | |
| Acesso em linha: | http://dx.doi.org/10.1016/j.akcej.2020.01.007 |