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: | Le Xuan Hung |
---|---|
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 |
Similar Items
Similar Items
-
ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS
by: Pavel A. Gein
Published: (2021-07-01) -
On List-Coloring and the Sum List Chromatic Number of Graphs.
by: Hall, Coleman
Published: (2011) -
The b-Chromatic Number of Star Graph Families
by: Vivin J. Vernold, et al.
Published: (2010-12-01) -
Weighted graphs: Eigenvalues and chromatic number
by: Charles Delorme
Published: (2016-04-01) -
On the chromaticity of complete multipartite graphs with certain edges added
by: Lau, G.C, et al.