Set vertex colorings and joins of graphs
Futaba Okamoto, Craig W. Rasmussen, Ping Zhang (2009)
Czechoslovak Mathematical Journal
Similarity:
For a nontrivial connected graph , let be a vertex coloring of where adjacent vertices may be colored the same. For a vertex of , the neighborhood color set is the set of colors of the neighbors of . The coloring is called a set coloring if for every pair of adjacent vertices of . The minimum number of colors required of such a coloring is called the set chromatic number . A study is made of the set chromatic number of the join of two graphs and . Sharp lower...