Set vertex colorings and joins of graphs. (English) Zbl 1224.05184
Summary: For a nontrivial connected graph \(G\), let \(c\: V(G)\to \mathbb {N}\) be a vertex colouring of \(G\), where adjacent vertices may be coloured the same. For a vertex \(v\) of \(G\), the neighbourhood colour set \(\operatorname {NC} (v)\) is the set of colours of the neighbours of \(v\). The colouring \(c\) is called a set colouring if \(\operatorname {NC} (u)\neq \operatorname {NC} (v)\) for every pair \(u,v\) of adjacent vertices of \(G\). The minimum number of colours required of such a colouring is called the set chromatic number \(\chi _{s}(G)\). A study is made of the set chromatic number of the join \(G + H\) of two graphs \(G\) and \(H\). Sharp lower and upper bounds are established for \(\chi _{s}(G+H)\) in terms of \(\chi _{s}(G)\), \(\chi _{s}(H)\) and the clique numbers \(\omega (G)\) and \(\omega (H)\).
References:
[1] | G. Chartrand, F. Okamoto, C.W. Rasmussen, P. Zhang: The set chromatic number of a graph. Discuss. Math. Graph Theory. To appear. · Zbl 1193.05073 |
[2] | G. Chartrand, P. Zhang: Chromatic Graph Theory. Chapman & Hall/CRC Press, Boca Raton, 2008. · Zbl 1169.05001 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.