The set chromatic number of a graph

DOI10.7151/dmgt.1463zbMath1193.05073OpenAlexW2090197064MaRDI QIDQ3560781

Gary Chartrand, Craig W. Rasmussen, Futaba Okamoto, Ping Zhang

Publication date: 14 May 2010

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2a8d32507c0f7ee4a6555ca3c8ae0efb99da7cff

zbMATH Keywords

neighbor-distinguishing coloringset coloringneighborhood color set

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

The set chromatic number of random graphs ⋮ The Sigma Chromatic Number of the Circulant Graphs $$C_n(1,2)$$ , $$C_n(1,3)$$ , and $$C_{2n}(1,n)$$ ⋮ Unnamed Item ⋮ Set vertex colorings and joins of graphs

This page was built for publication: The set chromatic number of a graph