List-Chromatic Number and Chromatically Unique of the Graph Kr2+Ok
In this paper, we determine list-chromatic number and characterize chromatically unique of the graph G = Kr2+k. We shall prove that ch(G) = r + 1 if 1<= k<=2, G is x-unique if 1<= k<=3.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Spanish |
| Published: |
Universidad Nacional de Trujillo
2019-07-01
|
| Series: | Selecciones Matemáticas |
| Subjects: | |
| Online Access: | http://revistas.unitru.edu.pe/index.php/SSMM/article/view/2440 |