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 |
| id |
doaj-ea4aac4dadb24b2e988a4386267c8aa3 |
|---|---|
| record_format |
Article |
| spelling |
doaj-ea4aac4dadb24b2e988a4386267c8aa32020-11-25T02:47:00ZspaUniversidad Nacional de TrujilloSelecciones Matemáticas2411-17832411-17832019-07-0161263010.17268/sel.mat.2019.01.04List-Chromatic Number and Chromatically Unique of the Graph Kr2+OkLe Xuan Hung0HaNoi University for Natural Resources and Environment 41 A, Phu Dien Road, Phu Dien precinct, North Tu Liem district, Hanoi, VietnamIn 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.http://revistas.unitru.edu.pe/index.php/SSMM/article/view/2440Chromatic numberlist-chromatic numberchromatic polinomialchromatically unique graphcomplete r- partite graph |
| collection |
DOAJ |
| language |
Spanish |
| format |
Article |
| sources |
DOAJ |
| author |
Le Xuan Hung |
| spellingShingle |
Le Xuan Hung List-Chromatic Number and Chromatically Unique of the Graph Kr2+Ok Selecciones Matemáticas Chromatic number list-chromatic number chromatic polinomial chromatically unique graph complete r- partite graph |
| author_facet |
Le Xuan Hung |
| author_sort |
Le Xuan Hung |
| title |
List-Chromatic Number and Chromatically Unique of the Graph Kr2+Ok |
| title_short |
List-Chromatic Number and Chromatically Unique of the Graph Kr2+Ok |
| title_full |
List-Chromatic Number and Chromatically Unique of the Graph Kr2+Ok |
| title_fullStr |
List-Chromatic Number and Chromatically Unique of the Graph Kr2+Ok |
| title_full_unstemmed |
List-Chromatic Number and Chromatically Unique of the Graph Kr2+Ok |
| title_sort |
list-chromatic number and chromatically unique of the graph kr2+ok |
| publisher |
Universidad Nacional de Trujillo |
| series |
Selecciones Matemáticas |
| issn |
2411-1783 2411-1783 |
| publishDate |
2019-07-01 |
| description |
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. |
| topic |
Chromatic number list-chromatic number chromatic polinomial chromatically unique graph complete r- partite graph |
| url |
http://revistas.unitru.edu.pe/index.php/SSMM/article/view/2440 |
| work_keys_str_mv |
AT lexuanhung listchromaticnumberandchromaticallyuniqueofthegraphkr2ok |
| _version_ |
1724755341438091264 |