On the Total Set Chromatic Number of Graphs

Given a vertex coloring c of a graph, the neighborhood color set of a vertex is defined to be the set of all of its neighbors’ colors. The coloring c is called a set coloring if any two adjacent vertices have different neighborhood color sets. The set chromatic number χs(G) of a graph G is the minim...

全面介紹

Saved in:
書目詳細資料
Main Authors: Tolentino, Mark Anthony C, Eugenio, Gerone Russel J, Ruiz, Mari-Jo P
格式: text
出版: Archīum Ateneo 2022
主題:
在線閱讀:https://archium.ateneo.edu/mathematics-faculty-pubs/216
https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1217&context=mathematics-faculty-pubs
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Ateneo De Manila University